Advertisement
Published in:
2014 | OriginalPaper | Chapter
Constructing an n-dimensional Cell Complex from a Soup of (n − 1)-Dimensional Faces
Authors : Ken Arroyo Ohori, Guillaume Damiand, Hugo Ledoux
Published in: Applied Algorithms
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.