A polygonal mesh partitioning algorithm based on protrusion conquest for perceptual 3D shape description - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

A polygonal mesh partitioning algorithm based on protrusion conquest for perceptual 3D shape description

Résumé

This paper introduces a novel partitioning algorithm for 3D polygonal meshes. The proposed approach is based on protrusion conquest which, for a given model, takes into account both the computed protrusion and the connectivity. The only constraint on the input mesh is that it must consist of one connected component. Our algorithm provides a good way to decompose the mesh into preceptually significant parts. The parts are further modeled by ellipsoids and a connectivity graph between them. This semantic representation is compliant to the perceptual shape description defined by the emergent standard MPEG-7.
Fichier principal
Vignette du fichier
VKS05SVE.pdf (1.02 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02272274 , version 1 (27-08-2019)

Identifiants

  • HAL Id : hal-02272274 , version 1

Citer

Sébastien Valette, Ioannis Kompatsiaris, Michael G Strintzis. A polygonal mesh partitioning algorithm based on protrusion conquest for perceptual 3D shape description. SVE, 2005, Villars, Switzerland. ⟨hal-02272274⟩

Collections

INSERM
34 Consultations
53 Téléchargements

Partager

Gmail Facebook X LinkedIn More