The Community for Technology Leaders
Green Image
A new parameter-free graph morphology based segmentation algorithm is proposed to address the problem of partitioning a 3D triangular mesh into disjoint sub- eshes that correspond to the physical parts of the underlying object. Curvedness, which is a rotation and translation invariant shape descriptor, is computed at every vertex in the input triangulation. Iterative graph dilation and morphological filtering of the outlier curvedness values result in multiple, disjoint, maximally connected sub-meshes such that each sub-mesh contains a set of vertices with similar curvedness values, and vertices in disjoint sub-meshes have significantly different curvedness values. Experimental evaluations using the triangulations of a number of complex objects demonstrate the robustness and the efficiency of the proposed algorithm and the results prove that it compares well with a number of state-of-the-art mesh segmentation algorithms.
mesh segmentation, shape descriptor, curvedness, graph morphology

A. Jagannathan and E. L. Miller, "Three-Dimensional Surface Mesh Segmentation Using Curvedness-Based Region Growing Approach," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 29, no. , pp. 2195-2204, 2007.
93 ms
(Ver 3.3 (11022016))