Skeleton extraction of vertex sets lying on arbitrary triangulated 3D meshes

6Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Complex models can be simply described by notions such as skeletons. These robust shape descriptors faithfully characterize the geometry and the topology of an object. Several methods have been developed yet to obtain the skeleton from regular object representations (e.g. 2D images or 3D volumes) but only a few attempt to extract the skeleton from unstructured 3D mesh patches. In this article, we extract a skeleton by topological thinning from vertex sets lying on arbitrary triangulated surface meshes in 3D. The key idea comes down to eroding a 2D set located on a discrete 2-manifold. The main difficulty is to transpose the notion of neighborhood from the classical thinning algorithms where the adjacency is constant (e.g. 26-adjacency in digital volumes, 8-adjacency in 2D images) to the mesh domain where the neighborhood is variable due to the adjacency of each vertex. Thus we propose a thinning operator dedicated to irregular meshes in order to extract the skeleton of a vertex set. To estimate the robustness of our technique, several tests and an application to the feature line detection are presented as a case-study. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kudelski, D., Viseur, S., & Mari, J. L. (2013). Skeleton extraction of vertex sets lying on arbitrary triangulated 3D meshes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7749 LNCS, pp. 203–214). Springer Verlag. https://doi.org/10.1007/978-3-642-37067-0_18

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