Constructing an n-dimensional cell complex from a soup of (N − 1)-dimensional faces

Ken Arroyo Ohori, Guillaume Damiand, Hugo Ledoux

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

7 Citations (Scopus)


There is substantial value in the use of higher-dimensional (>3D) digital objects in GIS that are built from complex real-world data. This use is however hampered by the difficulty of constructing such objects. In this paper, we present a dimension independent algorithm to build an n-dimensional cellular complex with linear geometries from its isolated (n − 1)-dimensional faces represented as combinatorial maps. It does so by efficiently finding the common (n − 2)-cells (ridges) along which they need to be linked. This process can then be iteratively applied in increasing dimension to construct objects of any dimension. We briefly describe combinatorial maps, present our algorithm using them as a base, and show an example using 2D, 3D and 4D objects which was verified to be correct, both manually and using automated methods.

Original languageEnglish
Title of host publicationApplied Algorithms
Subtitle of host publicationFirst International Conference, ICAA 2014, Kolkata, India, January 13-15, 2014. Proceedings
EditorsP. Gupta, C. Zaroliagis
Place of PublicationSwitzerland
Number of pages12
ISBN (Electronic)978-3-319-04126-1
ISBN (Print)978-3-319-04125-4
Publication statusPublished - 2014
Event1st International Conference on Applied Algorithms, ICAA 2014 - Kolkata, India
Duration: 13 Jan 201415 Jan 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)03029743
ISSN (Electronic)16113349


Conference1st International Conference on Applied Algorithms, ICAA 2014


Dive into the research topics of 'Constructing an n-dimensional cell complex from a soup of (N − 1)-dimensional faces'. Together they form a unique fingerprint.

Cite this