Mesh segmentation using feature point and core extraction

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

Abstract

Mesh segmentation has become a necessary ingredient in many applications in computer graphics. This paper proposes a novel hierarchical mesh segmentation algorithm, which is based on new methods for prominent feature point and core extraction. The algorithm has several benefits. First, it is invariant both to the pose of the model and to different proportions between the model's components. Second, it produces correct hierarchical segmentations of meshes, both in the coarse levels of the hierarchy and in the fine levels, where tiny segments are extracted. Finally, the boundaries between the segments go along the natural seams of the models. © Springer-Verlag 2005.

Cite

CITATION STYLE

APA

Katz, S., Leifman, G., & Tal, A. (2005). Mesh segmentation using feature point and core extraction. In Visual Computer (Vol. 21, pp. 649–658). https://doi.org/10.1007/s00371-005-0344-9

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