TY - JOUR

T1 - The Radial Topology Algorithm

T2 - A New Approach for Deriving 2.5D GIS Data Models

AU - Lenk, Ulrich

AU - Heipke, Christian

N1 - Funding Information: Acknowledgements This research was funded by a grant of the German Federal Environmental Foundation, Osnabrück, Germany. Topographic data were provided by the State Mapping Agency of Lower Saxony (Landesvermessung und Geobasisinformation Niedersachsen), Germany. The support by these organizations, as well as the helpful suggestions of the anonymous reviewers are gratefully acknowledged.

PY - 2007/1/13

Y1 - 2007/1/13

N2 - In this paper a new method for the combination of 2D GIS vector data and 2.5D DTM represented by triangulated irregular networks (TIN) to derive integrated triangular 2.5D object-based landscape models (also known as 2.5D-GIS-TIN) is presented. The algorithm takes into account special geometric constellations and fully exploits existing topologies of both input data sets, it "sews the 2D data into the TIN like a sewing-machine" while traversing the latter along the 2D data. The new algorithm is called radial topology algorithm. We discuss its advantages and limitations, and describe ways to eliminate redundant nodes generated during the integration process. With the help of four examples from practical work we show that it is feasible to compute and work with such integrated data sets. We also discuss the integrated data models in the light of various general requirements and conclude that the integration based on triangulations has a number of distinct advantages.

AB - In this paper a new method for the combination of 2D GIS vector data and 2.5D DTM represented by triangulated irregular networks (TIN) to derive integrated triangular 2.5D object-based landscape models (also known as 2.5D-GIS-TIN) is presented. The algorithm takes into account special geometric constellations and fully exploits existing topologies of both input data sets, it "sews the 2D data into the TIN like a sewing-machine" while traversing the latter along the 2D data. The new algorithm is called radial topology algorithm. We discuss its advantages and limitations, and describe ways to eliminate redundant nodes generated during the integration process. With the help of four examples from practical work we show that it is feasible to compute and work with such integrated data sets. We also discuss the integrated data models in the light of various general requirements and conclude that the integration based on triangulations has a number of distinct advantages.

KW - Algorithms

KW - DEM/DTM

KW - GIS

KW - Multi-dimensional data modelling

KW - Performance

KW - Triangulations

UR - http://www.scopus.com/inward/record.url?scp=33845434500&partnerID=8YFLogxK

U2 - 10.1007/s10707-006-0342-8

DO - 10.1007/s10707-006-0342-8

M3 - Article

AN - SCOPUS:33845434500

VL - 10

SP - 447

EP - 468

JO - GEOINFORMATICA

JF - GEOINFORMATICA

SN - 1384-6175

IS - 4

ER -