on for curves, if you make an algorithm that dynamically defines the possition of the controlpoints for NURBS curves as a function of the parameteres in F(t, a1,...,b1,...,c1,...)= x(t, a1, a2...)+y(t, b1, b2...)+ z(t, c1, c2...) or F(x, a, b ,c...)?
…
by its own tangent vector on the curve... and this happens to the last item. Here's the algorithm:
B0 ----> B1
B1 ----> B2
B2 ----> B3
B3 ----> B4
...
…
ider and a list item component to select a particular brep A or B or C, without selecting a particular breq inside each of them?
It seems the merge function will merge all the breqs inside each of the breps into one flattened list ...…
) function if you've already got a boolean value.
This expression:
x < 12
results in exactly the same things as this expression:
If( x < 12, True, False )
If() is only really useful when you want to return non-boolean data, like so:
If( x < 12, x, 100-x )
In this case, the expression will return either x, or 100-x if x is larger than or equal to 12:
x result
1 1
2 2
10 10
11 11
12 88
13 87
14 86
18 82
70 30
--
David Rutten
david@mcneel.com
Poprad, Slovakia…
Added by David Rutten at 7:22am on August 10, 2011
nt B2[i] so B1[i]<=0 means no new connections allowed for point i ,so point i is deleted from B1, B2 updated accordingly.
Initialization:
B1: max number of connections x number of points
B2: all the points
B3: nothing (well null or something, need to create the branch)
Algo:
Get first point in B2, get his allowed number of connections N in B1, find N closest points in B2, create lines in B3, update B2 accordingly. Erase points with max connections (including the first point)
Next
Stop when no points available
At end of loop, B3 stores the created lines.
…