Meaningful mesh segmentation guided by the 3d short-cut rule

2Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Extended from the 2D silhouette-parsing short-cut rule [25], a 3D short-cut rule, which states " as long as a cutting path mainly crosses local skeleton and lies in concave regions, the shorter path is (other things being equal) the better " , is defined in the paper. Guided by the 3D short-cut rule, we propose a hierarchical model decomposition paradigm, which integrates the advantages of the skeleton-driven and minima-rule-based meaningful segmentation. Our method defines geometrical and topological functions of skeleton to locate initial critical cutting points, and then employs salient contours with negative minimal principal curvature values to determine natural boundary curves among parts. Sufficient experiments have been carried out on many meshes, and have shown that our framework could provide more perceptual results than pure skeleton-driven or minima-rule-based algorithm. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Cheng, Z. Q., Li, B., Dang, G., & Jin, S. Y. (2008). Meaningful mesh segmentation guided by the 3d short-cut rule. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4975 LNCS, pp. 244–257). Springer Verlag. https://doi.org/10.1007/978-3-540-79246-8_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free