I have this :
list 3 : 0 1 2 3 4 5 6
list 2 : 0 1 2 3 4 5 6
list 1 : 0 1 2 3 4 5 6
list 0 : 0 1 2 3 4 5 6
and I want to group the points of index 0 in a branch, the points of index 1 in another branch and so on.
I attached a file in which I generated the points.
Thank you in advance for your help !
Regards
Red…
dont get you, i am saying sleect numbers in range 1 to 10, starting from 1 with a step of 2.
1 to 10 by 3 = 1 4 7 10
1 to 10 by 5 = 1 6
1 to 10 by 1 = 1 to 10 = 1 2 3 4 5 6 7 8 9 10
Added by Steve Lewis at 3:15pm on November 11, 2013
≈ 4.8 " as " x= 4.8 ± a ", do you know what is the min and max for "a"?
and second, i had tried the "round" function, but i faced problem with it too! for example:
if the input is a series as {0.0, 0.5, 1, 1.5, 2, 2.5, ...}
the output for Round(x, 0.5) is : {0, 0, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, ... }
and for Round(x, 2) the output is : {0.0, 0.5, 1, 1.5, 2, 2.5, ... }
i can't understand the logic that lies behind this function, i think
for Round(x, 0.5) the output must be {0.0, 0.5, 1, 1.5, 2, 2.5, 3, 3.5, 4, 4.5, ... }
and for Round(x, 2) it must be {0.0, 0.0, 2, 2, 2, 2, 4, 4, 4, 4, ... }
so, is there any problem with it, or I misendestood the logic ?…
bers of point) index
and I called the last point as indexMax
that what I wrote I am sure that I made some mistakes- so if one of you can help me I will be more then glad
If abc(sin(3 * pi() * ptList / ptLast)) < 0.5 Then harmony = 3 = z, 2 = x, 1 = y
A = 0
Else
A = 1
n = 0
For n < ptLast
If A(n) = A(n + 1) Then
Zf(n) = Z(n) + 12 * A(n)
n = n + 1
End If
(n + 4) < ptLast Then
Zf(n) = Z(n) + 12 * A(n)
Zf(n + 4) = Z(n + 4) + 12 * A(n + 4)
Zf(n + 2) = Z(n + 2) + 6
Zf(n + 1) = Z(n + 1) + 6 - 3 * (A(n + 4) - A(n))
Zf(n + 3) = Z(n + 1) + 6 + 3 * (A(n + 4) - A(n))
n = n + 5
End If
Else M = ptLast - n
For n<ptLast
Zf(n) = (ptLast - n) / M * 12 * A(ptLast - M) + Z(n)
n = n + 1
End
Zf(ptLast) = Z(ptLast)
…