3D Mesh Skeleton Extraction Using Topological ...
Type de document :
Communication dans un congrès avec actes
Titre :
3D Mesh Skeleton Extraction Using Topological and Geometrical Analyses
Auteur(s) :
Tierny, Julien [Auteur]
FOX MIIRE [LIFL]
Vandeborre, Jean Philippe [Auteur correspondant]
Institut TELECOM/TELECOM Lille1
FOX MIIRE [LIFL]
Daoudi, Mohamed [Auteur]
Institut TELECOM/TELECOM Lille1
FOX MIIRE [LIFL]
FOX MIIRE [LIFL]
Vandeborre, Jean Philippe [Auteur correspondant]

Institut TELECOM/TELECOM Lille1
FOX MIIRE [LIFL]
Daoudi, Mohamed [Auteur]

Institut TELECOM/TELECOM Lille1
FOX MIIRE [LIFL]
Titre de la manifestation scientifique :
14th Pacific Conference on Computer Graphics and Applications (Pacific Graphics 2006)
Ville :
Tapei
Pays :
Taïwan
Date de début de la manifestation scientifique :
2006-10-11
Titre de l’ouvrage :
14th Pacific Conference on Computer Graphics and Applications (Pacific Graphics 2006)
Date de publication :
2006-10-11
Mot(s)-clé(s) en anglais :
3D-mesh
skeleton
topology
geometry
Reeb graph
skeleton
topology
geometry
Reeb graph
Discipline(s) HAL :
Informatique [cs]/Vision par ordinateur et reconnaissance de formes [cs.CV]
Résumé en anglais : [en]
This paper describes a novel and unified approach for Reeb graph construction and simplification as well as constriction approximation on 3D polygonal meshes. The key idea of our algorithm is that discrete contours - curves ...
Lire la suite >This paper describes a novel and unified approach for Reeb graph construction and simplification as well as constriction approximation on 3D polygonal meshes. The key idea of our algorithm is that discrete contours - curves carried by the edges of the mesh and approximating the continuous contours of a mapping function - encode both topological and geometrical shape characteristics. Firstly, mesh feature points are computed. Then they are used as geodesic origins for the computation of an invariant mapping function that reveals the shape most significant features. Secondly, for each vertex in the mesh, its discrete contour is computed. As the set of discrete contours recovers the whole surface, each of them can be analyzed, both to detect topological changes or constrictions. Constriction approximations enable Reeb graphs refinement into more visually meaningful skeletons, that we refer as enhanced topological skeletons. Without pre-processing stages and without input parameters, our method provides nice-looking and affine- invariant skeletons, with satisfactory execution times. This makes enhanced topological skeletons good candidates for applications needing high level shape representations, such as mesh deformation (experimented in this paper), retrieval, compression, metamorphosis, etc.Lire moins >
Lire la suite >This paper describes a novel and unified approach for Reeb graph construction and simplification as well as constriction approximation on 3D polygonal meshes. The key idea of our algorithm is that discrete contours - curves carried by the edges of the mesh and approximating the continuous contours of a mapping function - encode both topological and geometrical shape characteristics. Firstly, mesh feature points are computed. Then they are used as geodesic origins for the computation of an invariant mapping function that reveals the shape most significant features. Secondly, for each vertex in the mesh, its discrete contour is computed. As the set of discrete contours recovers the whole surface, each of them can be analyzed, both to detect topological changes or constrictions. Constriction approximations enable Reeb graphs refinement into more visually meaningful skeletons, that we refer as enhanced topological skeletons. Without pre-processing stages and without input parameters, our method provides nice-looking and affine- invariant skeletons, with satisfactory execution times. This makes enhanced topological skeletons good candidates for applications needing high level shape representations, such as mesh deformation (experimented in this paper), retrieval, compression, metamorphosis, etc.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.archives-ouvertes.fr/hal-00725576/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-00725576/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-00725576/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- pg2006-final.pdf
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- pg2006-final.pdf
- Accès libre
- Accéder au document