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.
Document type :
Preprints, Working Papers, ...
GREYC-TR-2009-2. 2009
Liste complète des métadonnées

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00408202
Contributor : Sébastien Fourey <>
Submitted on : Wednesday, July 29, 2009 - 3:45:11 PM
Last modification on : Thursday, May 28, 2015 - 1:08:34 AM
Document(s) archivé(s) le : Tuesday, June 15, 2010 - 7:03:09 PM

File

GREYC-TR-2009-2.pdf
Files produced by the author(s)

Identifiers

  • 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〉

Share

Metrics

Record views

248

Document downloads

84