hope it will do the job (maybe its not the cleanest way, but it works for me sometimes. Depending on the ending of the lists you should wrap or not the shift component.
Good luck…
Added by Pep Tornabell at 2:05am on November 19, 2009
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...)?
…
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.
…
gone with the wind topic: since this is utterly Academic the main issue here is to oversimplify LBS (in real life: a collection of columns/beams/slabs/X members + tube frame rigid members (shafts/elevators/cats/dogs)). Reason is that if we use the real "solids" (turned into meshes) as the "node" pool for the hinges required ... only HAL 9000 could solve it in "real-time" (for instance an E5 Xeon 1630 v3 takes ... several minutes). And this is ... er ... challenging I must say. This is a typical case where "simplifying" means "stupidity" almost instantly.
Spam on:
where's my collection of "bend-a-truss-that-looks-like-a-tower" K1 demo defs? Is in this workstation or in another? (blame Alzheimer).
Spam off.
More soon.…
ide into 80 branches, and 80 outputs of explode and 80 dispatches - its my nightmare. Is there any way to do this with parametric Number of brunches? …