A compact topological DBMS data structure for 3D topography

9Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The objective is to develop a data structure that is capable of handling large data volumes and offers support for querying, analysis and validation. Based on earlier results (i.e. the full decomposition of space, the use of a TEN structure and applying Poincaŕe simplicial homology as mathematical foundation) a simplicial complex-based TEN structure is developed. Applying simplicial homology offers full control over orientation of simplexes and enables one to derive substantial parts of the TEN structure, instead of explicitly store the entire network. The described data structure is developed as a DBMS data structure and the usage of views, function based indexes and 3D R-trees result in a compact topological 3D data structure. Theoretical aspects of this approach are described earlier [12, 17, 18]. This paper describes both theory and implementation of the approach.

Cite

CITATION STYLE

APA

Penninga, F., & Van Oosterom, P. (2007). A compact topological DBMS data structure for 3D topography. In Lecture Notes in Geoinformation and Cartography (pp. 455–471). Kluwer Academic Publishers. https://doi.org/10.1007/978-3-540-72385-1_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free