Connecting walks and connecting dart sequences for n-D combinatorial pyramids

Sébastien Fourey 1 Luc Brun 1
1 Equipe Image - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen
Abstract : Combinatorial maps define a general framework which allows to encode any subdivision of an n-D orientable quasi-manifold with or without boundaries. Combinatorial pyramids are defined as stacks of successively reduced combinatorial maps. Such pyramids provide a rich framework which allows to encode fine properties of objects (either shapes or partitions). Combinatorial pyramids have first been defined in 2D. This first work has later been extended to pyramids of n-D generalized combinatorial maps. Such pyramids allow to encode stacks of non orientable partitions but at the price of a twice bigger pyramid. These pyramids are also not designed to capture efficiently the properties connected with orientation. This work presents the design of pyramids of n-D combinatorial maps and important notions for their encoding and processing.
Type de document :
Pré-publication, Document de travail
GREYC-TR-2009-2. 2009
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00408202
Contributeur : Sébastien Fourey <>
Soumis le : mercredi 29 juillet 2009 - 15:45:11
Dernière modification le : mardi 5 février 2019 - 12:12:43
Document(s) archivé(s) le : mardi 15 juin 2010 - 19:03:09

Fichier

GREYC-TR-2009-2.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00408202, version 1

Citation

Sébastien Fourey, Luc Brun. Connecting walks and connecting dart sequences for n-D combinatorial pyramids. GREYC-TR-2009-2. 2009. 〈hal-00408202〉

Partager

Métriques

Consultations de la notice

328

Téléchargements de fichiers

119