Encyclopedia of Big Data Technologies

Living Edition
| Editors: Sherif Sakr, Albert Zomaya

Query Processing: Computational Geometry

  • Amr MagdyEmail author
Living reference work entry
DOI: https://doi.org/10.1007/978-3-319-63962-8_297-1


Computational geometry studies computational algorithms on computer objects that are modeled as geometric shapes, e.g., points, lines, polygons, and surfaces.


Geometry has been used for decades to model computer objects with geometric shapes in two- and three-dimensional spaces, e.g., points, lines, polygons, and surfaces. Naturally, different applications that use these objects need to develop algorithms that process and query the geometric shapes for different scenarios and operations. This has started the evolution of computational geometry field that focuses on designing efficient algorithms for different operations and queries on geometric objects. These algorithms are used in several application domains such as computer graphics, computer-aided design and manufacturing (CAD/CAM), geographic information systems (GIS), and robotics motion planning and visibility problems. Part of these application domains intersect with the big data literature due to the large...

This is a preview of subscription content, log in to check access.


  1. Aggarwal A, Chazelle B, Guibas LJ, Ó’Dúnlaing C, Yap C (1988) Parallel computational geometry. Algorithmica 3:293–327Google Scholar
  2. Akl SG, Lyons KA (1993) Parallel computational geometry. Prentice Hall, Englewood CliffsGoogle Scholar
  3. Andrew AM (1979) Another efficient algorithm for convex hulls in two dimensions. Inf Process Lett 9(5): 216–219CrossRefGoogle Scholar
  4. Bartling F, Hinrichs KH (1992) A plane-sweep algorithm for finding a closest pair among convex planar objects. In: Proceedings of the annual symposium on theoretical aspects of computer science, STACS, pp 221–232CrossRefGoogle Scholar
  5. Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18(9):509–517CrossRefGoogle Scholar
  6. Chen H, Chen W (2016) GPU-accelerated blind and robust 3D mesh watermarking by geometry image. Int J Multimedia Tools Appl 75(16):10077–10096CrossRefGoogle Scholar
  7. de Berg M, Cheong O, van Kreveld MJ, Overmars MH (2008) Computational geometry: algorithms and applications, 3rd edn. Springer, Berlin/HeidelbergGoogle Scholar
  8. Eldawy A, Li Y, Mokbel MF, Janardan R (2013) CG_Hadoop: computational geometry in mapreduce. In: Proceedings of the international conference on advances in geographic information systems, ACM SIGSPATIAL, pp 284–293Google Scholar
  9. Fortune S (1987) A sweepline algorithm for Voronoi diagrams. Algorithmica 2:153–174MathSciNetCrossRefGoogle Scholar
  10. Kalyvas C, Tzouramanis T (2017) A survey of skyline query processing. CoRR abs/1704.01788. http://arxiv.org/abs/1704.01788
  11. Lee DT, Preparata FP (1984) Computational geometry – a survey. IEEE Trans Comput 33(12):1072–1101Google Scholar
  12. Liknes S, Vlachou A, Doulkeridis C, Nørvåg K (2014) APSkyline: improved skyline computation for multicore architectures. In: Proceedings of the international conference on database systems for advanced applications, DASFAA, pp 312–326CrossRefGoogle Scholar
  13. McKenney M, Frye R, Dellamano M, Anderson K, Harris J (2017) Multi-core parallelism for plane sweep algorithms as a foundation for GIS operations. GeoInformatica 21(1):151–174CrossRefGoogle Scholar
  14. Meagher D (1982) Geometric modeling using cctree encoding. Comput Graph Image Process 19(2):129–147CrossRefGoogle Scholar
  15. Miller R, Stout QF (1988) Efficient parallel convex hull algorithms. IEEE Trans Comput 37(12):1605–1618MathSciNetCrossRefGoogle Scholar
  16. Nievergelt J, Preparata FP (1982) Plane-sweep algorithms for intersecting geometric figures. Commun ACM 25(10):739–747CrossRefGoogle Scholar
  17. Puri S, Agarwal D, Prasad SK (2017) Polygonal overlay computation on cloud, Hadoop, and MPI. In: Encyclopedia of GIS, pp 1598–1606CrossRefGoogle Scholar
  18. Samet H (1984) The quadtree and related hierarchical data structures. ACM Comput Surv 16(2):187–260MathSciNetCrossRefGoogle Scholar
  19. Sebastian J, Sivadasan N, Banerjee R (2014) GPU accelerated three dimensional unstructured geometric multigrid solver. In: Proceedings of the international conference on high performance computing & simulation, HPCS, pp 9–16Google Scholar
  20. Vlachou A, Doulkeridis C, Kotidis Y (2008) Angle-based space partitioning for efficient parallel skyline computation. In: Proceedings of the ACM SIGMOD international conference on management of data, SIGMOD, pp 227–238Google Scholar
  21. Zhang J, Jiang X, Ku W, Qin X (2016) Efficient parallel skyline evaluation using mapreduce. IEEE Trans Parallel Distributed Syst 27(7):1996–2009CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.University of CaliforniaRiversideUSA

Section editors and affiliations

  • Timos Sellis
    • 1
  • Aamir Cheema
  1. 1.Data Science Research InstituteSwinburne University of TechnologyMelbourneAustralia