algorithmic modeling for Rhino
Tags:
Update:
Found a couple of minutes to add some other stuff/options. Almost ready.
Compare times. (no // stuff used, mind).
By angle sort (not that bad ... but why bother?):
By sort along curve (slower than any Harley Davidson... only for masochists). In this the Method for dealing correctly with boundary faces is not implemented (but why bother? this is junk food only used for indicating the obvious).
By indices Lists intersections (faster than my Panigale):
Some partners of mine in the practice (top C# dogs) are impressed:
Looks nice, what do colors represent?
Would it be possible to see the code for connectivity freaky stuff?
Get the public version of the whole approach (it doesn't work with Lists (meaning: no meshes with disjoint pieces etc etc) , provides some of the 9 possible connectivity trees, does not check input meshes ... and has some other limitations as well (for instance: no // processing)):
PS: For mesh aficionados (I hate meshes) who may want to fully exploit the 9 connectivity trees via their own code:
The EV (and thus VE) connectivity trees are occasionally wrong because ... these lines of code yield bananas (occasionally, that is):
Why? Who knows? And who cares? (not me anyway). Quite propably David, Giulio or Daniel are aware of that "bug",
For instance the V(as ball)E(as tubes) works OK for this mesh:
Yikes + Yikes:
A vertex index in mesh.Vertices is not the same in mesh.TopologyVertices. The former is required in order to get the naked status and the latter ... in order to make the VE/EV connectivity correctly.
See attached.
Welcome to
Grasshopper
Added by Parametric House 0 Comments 0 Likes
Added by Parametric House 0 Comments 0 Likes
Added by Parametric House 0 Comments 0 Likes
© 2024 Created by Scott Davidson. Powered by