A First Step toward Combinatorial Pyramids in n-D Spaces

  • Authors:
  • Sébastien Fourey;Luc Brun

  • Affiliations:
  • GREYC, CNRS UMR 6072, ENSICAEN, Caen, France F-14050;GREYC, CNRS UMR 6072, ENSICAEN, Caen, France F-14050

  • Venue:
  • GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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 the 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. The present work presents our first results on the design of a pyramid of n -D combinatorial maps.