A Greedy Merging Method for User-Steered Mesh Segmentation

In this paper, we discuss the mesh segmentation problem which divides a given 3D mesh into several disjoint sets. To solve the problem, we propose a greedy method based on the merging priority metric defined for representing the geometric properties of meaningful parts. The proposed priority metric is a weighted function using five geometric parameters, those are, a distribution of Gaussian map, boundary path concavity, boundary path length, cardinality, and segmentation resolution. In special, we can control by setting up the weight values of the proposed geometric parameters to obtain visually better mesh segmentation. Finally, we carry out an experiment on several 3D mesh models using the proposed methods and visualize the results.