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
I need only lenght of (a) side. Then from Acos(a/r) I have angle for vector. I think easy and it works.
Could you explain the ArrayOnX_EVENT please, or how I can get a intersect point from OnNurbsCurve.IntersectCurve method.
Thanks ;)…
Added by Lukáš Kurilla at 1:21pm on January 19, 2010
ptimization of any kind. If I were to add a space voxelization algorithm to it I could probably do away with 90% of the force vectors in a large particle cloud.
http://www.youtube.com/watch?v=RmsbzTf79bc
--
David Rutten
david@mcneel.com
Poprad, Slovakia…
Added by David Rutten at 5:35am on December 16, 2009
ven if the number of panels inside each cell varies. The current solution works when the number of panels inside each cell is always two or other same numbers, but it wouldn't work if the number of panels inside frames are different in each cell. It would be perfect, if numbering of panels are automatically added correctly next to the cell number based on the number of panel division instead of feeding the fixed number.
To take an example, let's assume that the cell #80 has three panels and the #81 has two ones. In this case, three panels within the cell #80 would be numbered like 80-1, 80-2, 80-3, while two panels within the #81 would be numbered such as 81-1 and 81-2 automatically. …