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

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...

Modelling Higher Dimensional Data for GIS Using Generalised Maps

Real-world phenomena have traditionally been modelled in 2D/3D GIS. However, powerful insights can be gained by integrating additional non-spatial dimensions, such as time and scale. While this integration to form higher-dimensional objects is theoretically sound, its implementation is problematic since the data models used in GIS are not...

Manipulating higher dimensional spatial information

Real-world phenomena have traditionally been modelled in a GIS in two and three dimensions. However, powerful insights can be gained by the integration of additional non-spatial dimensions, such as time and scale, in a higher dimensional spatial model. While this theory is conceptually sound, there is a lack of understanding of its consequences...

Integrating Scale and Space in 3D City Models

This paper presents the problem of the current separate treatment of levels of detail in city models. We propose a solution, detail the main principles, and present our initial results on the approach. We conclude with work in progress and explain the benefits of our approach.

5D Modelling - applications and advantages

As explained in van Oosterom & Stoter (2012), the nD modeling approach allows us to include different aspects of geo-information in spatial modeling at a fundamental level, i.e. by treating these aspects as additional (geometric) dimensions. This paper explains how nD data models and data structures may solve the issues of redundancy and...

Automatically repairing invalid polygons with a constrained triangulation

Although the validation of single polygons has received considerable attention, the automatic repair of invalid polygons has not. Automated repair methods can be considered as interpreting ambiguous or ill-defined polygons and giving a coherent and clearly defined output. At this moment, automatic tools are not satisfactory and repairing is thus...

Edge-matching polygons with a constrained traingulation

While the edge-matching problem is usually tackled by snapping geometries within a certain threshold, we argue in this paper that this method is error-prone and often leads to geometries that are invalid. We present a novel edge-matching algorithm for polygons where vertices are not moved (no snapping is involved); instead gaps and overlaps...