CEFM: A Heuristic Mesh Segmentation Method based on Convexity Estimation and Fast Marching
Published in The 10th International Conference on Computer Graphics Theory and Applications, 2015
Abstract. Mesh segmentation is a fundamental way of shape analysis and understanding for 3D mesh models. In this paper, we propose an effective heuristic mesh segmentation algorithm, which is based on concave areas detection and heuristic 2-category classification via fast marching. The algorithm has several merits. First, the boundary between each pair of segments is close to the natural seams of 3D objects. Second, it is robust against pose variations and isometric transformations. Finally, our algorithm decomposes non-rigid 3D models into a set of rigid components in a short period of time and the procedure is fully automatic. Extensive experiments in this paper demonstrate that the proposed method outperforms the state of the art in mesh segmentation.
Reference:
- Jun Zhang, Zhouhui Lian, Zhenbao Liu and Jianguo Xiao. “CEFM: A Heuristic Mesh Segmentation Method based on Convexity Estimation and Fast Marching.” GRAPP 2015, 114–121.