We need your help! 🔥

Please consider disabling your ad-blocker to support this website! 🔑
We are a free, community-supported website! 🥰
We only display small unobtrusive ads which help us stay online! 💯
Thank you in advance! ❤️


1\|Mesh Graph


2\|Weight Graph


3\|Primary Segmentation

4|Secondary Segmentation

5|Iterative Segmentation


6\|Special Segmentation


7\|Fabrication


8\|Mesh Info


9\|Other Tools

MST Kruskal Valence

Compute the minimum spanning tree for the mesh graph using a modified Kruskal's algorithm with max valence preference

Inputs

Name	ID	Description	Type
MeshGraph	G	The MGraph object used for MST calculation	MGraph
Weight Limit	W	Optional domain for the weights to be considered	Domain
Valence	V	The maximum valence for the node. This value signifies a preference not a limit	Integer
Size	S	The maximum number of nodes in one piece	Integer

Outputs

Name	ID	Description	Type
MSTGraph	G	The minimum spanning tree/trees MGraph object	MGraph

MST Kruskal Valence

Compute the minimum spanning tree for the mesh graph using a modified Kruskal's algorithm with max valence preference

Inputs

Outputs

Video Tutorials