- P-ISSN1738-6764
- E-ISSN2093-7504
- KCI
ISSN : 1738-6764
Hierarchical Mesh Segmentation Based on Global Sharp Vertices
Park, Chan
Park, Young-Jin
Ha, Jong-Sung
Abstract
In this paper, we propose a hierarchical method for segmenting a given 3D mesh, which hierarchically clusters sharp vertices of the mesh using the metric of geodesic distance among them. Sharp vertices are extracted from the mesh by analyzing convexity that reflects global geometry. As well as speeding up the computing time, the sharp vertices of this kind avoid the problem of local optima that may occur when feature points are extracted by analyzing the convexity that reflects local geometry. For obtaining more effective results, the sharp vertices are categorized according to the priority from the viewpoint of cognitive science, and the reasonable number of clusters is automatically determined by analyzing the geometric features of the mesh.
- keywords
- Mesh Segmentation, Hierarchical Clustering, Sharp Vertex, Geodesic Distance
- Downloaded
- Viewed
- 0KCI Citations
- 0WOS Citations