Connecting walks and connecting dart sequences for n-D combinatorial pyramids - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2009

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

Luc Brun
  • Function : Author
  • PersonId : 936962

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.
Fichier principal
Vignette du fichier
GREYC-TR-2009-2.pdf (394.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00408202 , version 1 (29-07-2009)

Identifiers

  • HAL Id : hal-00408202 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More