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 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

Inputs

Name	ID	Description	Type
MeshGraph	G	The MGraph object used for MST calculation	MGraph
Interval	I	Edges 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.0	Domain

Outputs

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

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

Inputs

Outputs

Video Tutorials