5 8, and then the following values are obtain as the last one (8) plus 3, then this last one (11) plus 5, and then this last one (16) plus 8, and then it starts again: 24+3, 27+5, 32+8...
Thanks
…
Added by Jesus Galvez at 5:17am on November 27, 2012
etting when I merge the three trees, but what I would like to get is:
essentially a tree with 27 branches, each with a single list of either 11 or 21 points.
{0} (N=11)
{1} (N=11)
...
{10} (N=21)
{11} (N=21)
...
{17} (N=11)
{18) (N=11)
{27} (N=11)
Any help would be greatly appreciated.
All the best,
Matt
…
Added by Matt Schmid at 3:06pm on December 4, 2010
where each branch contains all the points generated by dividing each curve, so if you divide into 10 segments, you'll get:
{0;0}(N = 11)
{0;1}(N = 11)
{0;2}(N = 11)
{0;3}(N = 11)
{0;4}(N = 11)
Where the second integer in the curly brackets refers back to the index of the curve in the original list.
Another way to look at this data is to see it as a table. It's got 5 rows (one for each original curve) and 11 columns, where every column contains a specific division point.
--
David Rutten
david@mcneel.com
Poprad, Slovakia…