Research and application on a segmentation algorithm for triangle meshes

Mesh segmentation has become a key ingredient in many geometric modeling and computer graphics applications. This paper proposes a new triangle mesh segmentation algorithm. This algorithm puts forward a new segmentation method for initialization based on geodesic distance and meshes region growing, and puts the same type vertices together. Geodesic distance expresses the shortest path between the vertices. The shortest path is calculated through classical Dijkstra algorithm. This algorithm is applied to mesh simplification and adaptive subdivision. Experimental results show that the algorithm not only has the stability and efficiency, but also better describes the characteristics of model features.