HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

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 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, ...
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download

Contributor : Sébastien Fourey Connect in order to contact the contributor
Submitted on : Wednesday, July 29, 2009 - 3:45:11 PM
Last modification on : Tuesday, October 19, 2021 - 11:34:55 PM
Long-term archiving on: : Tuesday, June 15, 2010 - 7:03:09 PM


Files produced by the author(s)


  • HAL Id : hal-00408202, version 1


Sébastien Fourey, Luc Brun. Connecting walks and connecting dart sequences for n-D combinatorial pyramids. 2009. ⟨hal-00408202⟩



Record views


Files downloads