DUAL HALF EDGE DATA STRUCTURE in DATABASE for BIG DATA in GIS

4Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

In GIS, different types of data structures have been proposed in order to represent 3D models and examining the relationship between spatial objects. The Dual Half-Edge (DHE) is a data structure that permits the simultaneous representation of the geometry and topology of models with a special focus on building interiors. In this paper, from the storage cost point of view, the G-Maps model is analyzed and compared with the DHE model, since they have some features in common and also G-Maps is used widely in GIS. The primary result shows that the DHE is more efficient than the G-Maps with regard to the storage cost.

Cite

CITATION STYLE

APA

Goudarzi, M., Asghari, M., Boguslawski, P., & Rahman, A. A. (2015). DUAL HALF EDGE DATA STRUCTURE in DATABASE for BIG DATA in GIS. In ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences (Vol. 2, pp. 41–45). Copernicus GmbH. https://doi.org/10.5194/isprsannals-II-2-W2-41-2015

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