@TechReport{TR-fourey-09,


url = {HAL:=http://hal.archives-ouvertes.fr/hal-00408202, pdf:=http://hal.archives-ouvertes.fr/hal-00408202/PDF/GREYC-TR-2009-2.pdf},
title = {Connecting walks and connecting dart sequences for n-D combinatorial pyramids},
author = {Fourey, S{'e}bastien and Brun, Luc},
keywords = {combinatorial maps;combinatorial pyramids;hierarchical models},
affiliation = {Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen - GREYC},
note = {GREYC-TR-2009-2 GREYC-TR-2009-2 },
year = {2009-07},
theme = {hierarchical},
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.}

 }