algorithmic modeling for Rhino

1|Create Graph
1|Mesh Graph
2|Weight Graph
3|Primary Segmentation
3|Tree Graph
4|Tools Graph
5|Iterative Segmentation
5|Split Graph
6|Special Segmentation
6|Use Graph
7|Agent Graph
8|Mesh Info
8|Visualize Graph
9|Other Tools

MST Kruskal concavity

Component Index > Ivy > 3|Primary Segmentation > MST Kruskal concavity

Compute the minimum spanning tree for the mesh graph including convex, concave and flat region detection. This uses a modified Kruskal algorithm with weight limits


MeshGraphGThe MGraph object used for MST calculationGoo
IntervalIEdges weights inside this interval will be considered only. Edges crossing from flat to convex or concave will have their weight incremented with 1.0 and edges passing from concave to convex or the other way around will have their weight incremented with 2.0Interval


MSTGraphGThe minimum spanning tree/trees MGraph objectGoo

© 2018   Created by Robin Rodricks and Andrew Heumann.   Hosted by

Badges  |  Report an Issue  |  Terms of Service