In this paper, we propose a practical algorithm for extracting curve skeletons from a 3D shape represented by a triangular mesh. We first construct an initial skeleton graph by copying the connectivity and geometry information from the input mesh. We then perform iterative skeletonization over the nodes of the skeleton graph using coupled processes of graph contraction and surface clustering. In the contraction step, the skeleton graph is simplified and regularized with surface clustering: mesh vertices are clustered, while the positions of nodes in the skeleton graph are updated at the same time. Eventually, the skeleton graph is automatically simplified to an approximately-centered curve skeleton. Our algorithm naturally produces a skeleton-to-surface mapping, making the output skeletons directly applicable to skinning deformation. © 2012 Springer-Verlag.
CITATION STYLE
Jiang, W., Xu, K., Cheng, Z. Q., Martin, R. R., & Dang, G. (2012). Curve skeleton extraction by graph contraction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7633 LNCS, pp. 178–185). https://doi.org/10.1007/978-3-642-34263-9_23
Mendeley helps you to discover research relevant for your work.