Advertisement

Crisp Clustering Algorithm for 3D Geospatial Vector Data Quantization

  • Suhaibah AzriEmail author
  • François Anton
  • Uznir Ujang
  • Darka Mioc
  • Alias A. Rahman
Chapter
Part of the Lecture Notes in Geoinformation and Cartography book series (LNGC)

Abstract

In the next few years, 3D data is expected to be an intrinsic part of geospatial data. However, issues on 3D spatial data management are still in the research stage. One of the issues is performance deterioration during 3D data retrieval. Thus, a practical 3D index structure is required for efficient data constellation. Due to its reputation and simplicity, R-Tree has been received increasing attention for 3D geospatial database management. However, the transition of its structure from 2D to 3D had caused a serious overlapping among nodes. Overlapping nodes also occur during splitting operation of the overflown node N of M + 1 entry. Splitting operation is the most critical process of 3D R-Tree. The produced tree should satisfy the condition of minimal overlap and minimal volume coverage in addition with preserving a minimal tree height. Based on these concerns, in this paper, we proposed a crisp clustering algorithm for the construction of a 3D R-Tree. Several datasets are tested using the proposed method and the percentage of the overlapping parallelepipeds and volume coverage are computed and compared with the original R-Tree and other practical approaches. The experiments demonstrated in this research substantiated that the proposed crisp clustering is capable to preserve minimal overlap, coverage and tree height, which is advantageous for 3D geospatial data implementations. Another advantage of this approach is that the properties of this crisp clustering algorithm are analogous to the original R-Tree splitting procedure, which makes the implementation of this approach straightforward.

Keywords

3D spatial data management 3D spatial data clustering 3D Geo-DBMS 3D spatial indexing 

Notes

Acknowledgments

Major funding for this research was supported by the Ministry of Education Malaysia.

References

  1. Al-Badarneh AF, Al-Alaj AS, Mahafzah BA (2013) Multi small index (MSI): a spatial indexing structure. J Info Sci 39(5):643–660CrossRefGoogle Scholar
  2. Ang CH, Tan TC (1997) New linear node splitting algorithm for R-trees. In: Scholl M, Voisard A (eds) Advances in spatial databases. Lecture notes in computer science, vol 1262. Springer, Berlin, pp 337–349. doi: 10.1007/3-540-63238-7_38
  3. Arens C, Stoter J, van Oosterom P (2005) Modelling 3D spatial objects in a geo-DBMS using a 3D primitive. Comput Geosci 31(2):165–177. doi:http://dx.doi.org/10.1016/j.cageo.2004.05.013
  4. Arthur D Vassilvitskii S (2007) k-means++: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms. Society for industrial and applied mathematics, pp 1027–1035Google Scholar
  5. Balasubramanian L, Sugumaran M (2012) A state-of-art in R-tree variants for spatial indexing. Int J Comput Appl 42(20)Google Scholar
  6. Fu Y, Teng J-C (2002) Subramanya S node splitting algorithms in tree-structured high-dimensional indexes for similarity search. In: Proceedings of the 2002 ACM symposium on applied computing. ACM, pp 766–770Google Scholar
  7. Guttman A (1984) R-trees: a dynamic index structure for spatial searching. SIGMOD Rec 14(2):47–57. doi: 10.1145/971697.602266 CrossRefGoogle Scholar
  8. Izham MY, Uznir U, Alias AR, Ayob K (2010) Georeference, rainfall-runoff modeling and 3D dynamic simulation: physical influence, integration and approaches. In: ACM, 1st international conference and exhibition on computing for geospatial research and application, Washington, DC. 1st international conference and exhibition on computing for geospatial research and application, COM.Geo 2010Google Scholar
  9. Jazayeri I (2012) Trends in 3D land information collection and management. In: Rajabifard A, Williamson I, Kalantari M (eds) A national infrastructure for managing land information. University of Melbourne, pp 81–87Google Scholar
  10. Kamel I, Faloutsos C (1994) Hilbert R-tree: an improved R-tree using fractals. Paper presented at the proceedings of the 20th international conference on very large data basesGoogle Scholar
  11. Korotkov A (2012) A new double sorting-based node splitting algorithm for R-tree. Program Comput Softw 38(3):109–118CrossRefGoogle Scholar
  12. Liu Y, Fang J, Han C (2009) A new R-tree node splitting algorithm using MBR partition policy. In: 17th international conference on geoinformatics, 2009. IEEE, pp 1–6Google Scholar
  13. Liu Y, Liu G, He Z (2010) Spatial index technology for multi-scale and large scale spatial data. In: 18th international conference on geoinformatics, 2010. IEEE, pp 1–4Google Scholar
  14. MacQueen J (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, California, USA, p 14Google Scholar
  15. Manolopoulos Y, Nanopoulos A, Papadopoulos AN, Theodoridis Y (2006) Rtrees: theory and applications. Springer, HeidelbergGoogle Scholar
  16. Paar P (2006) Landscape visualizations: applications and requirements of 3D visualization software for environmental planning. Comput Environ Urban Syst 30(6):815–839. doi:http://dx.doi.org/10.1016/j.compenvurbsys.2005.07.002
  17. Sleit A (2008) On using B+-tree for efficient processing for the boundary neighborhood problem. Paper presented at the WSEAS transactions on systemsGoogle Scholar
  18. Sleit A, Al-Nsour E (2014) Corner-based splitting: an improved node splitting algorithm for R-tree. J Info Sci. doi: 10.1177/0165551513516709 Google Scholar
  19. Sugihara K, Shen Z (2012) Automatic generation of virtual 3D city models for urban planning. In: Geospatial techniques in urban planning. Advances in geographic information science. Springer, Berlin, pp 265-283. doi: 10.1007/978-3-642-13559-0_13
  20. Uznir U, Anton F, Suhaibah A, Rahman A, Mioc D (2013a) Improving 3D spatial queries search: newfangled technique of space filling curves in 3D city modeling. In: 8th 3D geoinfo conference and ISPRS WG II/2 workshopGoogle Scholar
  21. Uznir U, François A, Alias AR (2013b) Unified data model of urban air pollution dispersion and 3D spatial city model: groundwork assessment towards sustainable urban development for Malaysia. J Environ Prot 4(7):701–712. doi: 10.4236/jep.2013.47081 CrossRefGoogle Scholar
  22. Wand M, Berner A, Bokeloh M, Fleck A, Hoffmann M, Jenke P, Maier B, Staneker D (2007) Schilling a interactive editing of large point clouds. In: SPBG, pp 37–45Google Scholar
  23. Wang Y, Sheng Y, Zhou L, Guo F, Zhao L (2010) An underground space object-oriented three-dimensional hybrid spatial indexing method. In: 18th international conference on geoinformatics, 2010. IEEE, pp 1–5Google Scholar
  24. Xu Z, Coors V (2012) Combining system dynamics model, GIS and 3D visualization in sustainability assessment of urban residential development. Build Environ 47(0):272–287. doi:http://dx.doi.org/10.1016/j.buildenv.2011.07.012
  25. Zhu Q, Gong J, Zhang Y (2007) An efficient 3D R-tree spatial index method for virtual geographic environments. ISPRS J Photogram Remote Sens 62(3):217–224. doi:http://dx.doi.org/10.1016/j.isprsjprs.2007.05.007
  26. Zlatanova S (2000) 3D GIS for urban development. International Institute for Aerospace Survey and Earth Sciences (ITC)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Suhaibah Azri
    • 1
    Email author
  • François Anton
    • 2
  • Uznir Ujang
    • 1
  • Darka Mioc
    • 2
  • Alias A. Rahman
    • 1
  1. 1.3D GIS Research Group, Department of Geoinformation, Faculty of Geoinformation and Real EstateUniversiti Teknologi MalaysiaSkudai, JohorMalaysia
  2. 2.Department of Geodesy, National Space InstituteTechnical University of DenmarkKongens LyngbyDenmark

Personalised recommendations