represent the list rearrangement. It would also be great for this to accommodate variable list lengths because the u/v gridlines on the original surface are tbd
…
curve B
B1--------------------------B0
You define distances:
|A0 B0|
|A0 B1|
|A1 B0|
|A1 B1|
And find the smallest one. Then, based on the number of the shortest distance:
Flip A, Leave B
Flip A, Flip B
Leave A, Leave B
Leave A, Flip B
A more advanced metric would be to create all 4 blends, then pick the one that is shortest. Maybe that works better for what you want, maybe not.
--
David Rutten
david@mcneel.com…
Added by David Rutten at 8:09am on February 11, 2014
, a1200)}) Is there any way I can make this list into {a1, a2, a3, a4, -a5, -a6, -a7, -a8, a9, a10, a11, a12, -a13, ..... , a1200} ? ( 4 positive signs then 4 negative signs and so on) - alternating every nth in general.
or
2. Is there any way (workaround) to get negative angle value from 2 vectors? I know 'ANGLE (of 2 vectors)' component by itself doesn't work and I know why too. I have feeling that the reflex angle output might be useful but again, matter of list manipulation.
Any help would be greatly appreciated. Thanks in advance.
Hyo
…
g these times itself). If it works on selection alone, it would probably implement faster.
Theoretically, does this mean the total solving time of the definition is the 'chain of components' that takes the longest time? In the picture above, it would be the chain consisting 'point-curve-divideDistance'?
Because that still adds up only to 97%, I am assuming the Point and Slider component start solving in parallel, and the two Divide components also start solving in parallel?…
am doing the paneling tutorial from the first primer..pg 88. i baked it but while selecting the multiple geometries i cannot select individual ones, they are selected as surfaces..is that ok or .....?
Added by SHILPA PANDE at 6:25am on February 16, 2013