@INPROCEEDINGS{CI-FOUREY-2009-2,


author = {Fourey, S'ebastien and Brun, Luc},
title = {Connecting walks and connecting dart sequences for {n-D} combinatorial pyramids},
booktitle = {Progress in Combinatorial Image Analysis (International Workshop on Combinatorial Image Analysis)},
year = 2009,
editor = {Wiederhold, P. and Barneva, R. P.},
pages = {109--122},
address = {Cancun, Mexico},
month = {Nov.},
publisher = {Research Publishing Services},
theme = {hierarchical},
url = {paper(pdf):=https://brunl01.users.greyc.fr/ARTICLES/iwcia2009FoureyBrun.pdf},

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. replace{The
present}{This} work presents the design of pyramids
of $n$-D combinatorial maps and important notions
for their encoding and processing."

 }