References
Aggarwal A, Chazelle B, Guibas LJ, Ó’Dúnlaing C, Yap C (1988) Parallel computational geometry. Algorithmica 3:293–327
Akl SG, Lyons KA (1993) Parallel computational geometry. Prentice Hall, Englewood Cliffs
Andrew AM (1979) Another efficient algorithm for convex hulls in two dimensions. Inf Process Lett 9(5): 216–219
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–232
Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18(9):509–517
Chen H, Chen W (2016) GPU-accelerated blind and robust 3D mesh watermarking by geometry image. Int J Multimedia Tools Appl 75(16):10077–10096
de Berg M, Cheong O, van Kreveld MJ, Overmars MH (2008) Computational geometry: algorithms and applications, 3rd edn. Springer, Berlin/Heidelberg
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–293
Fortune S (1987) A sweepline algorithm for Voronoi diagrams. Algorithmica 2:153–174
Kalyvas C, Tzouramanis T (2017) A survey of skyline query processing. CoRR abs/1704.01788. http://arxiv.org/abs/1704.01788
Lee DT, Preparata FP (1984) Computational geometry – a survey. IEEE Trans Comput 33(12):1072–1101
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–326
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–174
Meagher D (1982) Geometric modeling using cctree encoding. Comput Graph Image Process 19(2):129–147
Miller R, Stout QF (1988) Efficient parallel convex hull algorithms. IEEE Trans Comput 37(12):1605–1618
Nievergelt J, Preparata FP (1982) Plane-sweep algorithms for intersecting geometric figures. Commun ACM 25(10):739–747
Puri S, Agarwal D, Prasad SK (2017) Polygonal overlay computation on cloud, Hadoop, and MPI. In: Encyclopedia of GIS, pp 1598–1606
Samet H (1984) The quadtree and related hierarchical data structures. ACM Comput Surv 16(2):187–260
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–16
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–238
Zhang J, Jiang X, Ku W, Qin X (2016) Efficient parallel skyline evaluation using mapreduce. IEEE Trans Parallel Distributed Syst 27(7):1996–2009
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this entry
Cite this entry
Magdy, A. (2018). Query Processing: Computational Geometry. In: Sakr, S., Zomaya, A. (eds) Encyclopedia of Big Data Technologies. Springer, Cham. https://doi.org/10.1007/978-3-319-63962-8_297-1
Download citation
DOI: https://doi.org/10.1007/978-3-319-63962-8_297-1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-63962-8
Online ISBN: 978-3-319-63962-8
eBook Packages: Springer Reference MathematicsReference Module Computer Science and Engineering
Publish with us
Chapter history
-
Latest
Query Processing: Computational Geometry- Published:
- 25 February 2022
DOI: https://doi.org/10.1007/978-3-319-63962-8_297-2
-
Original
Query Processing: Computational Geometry- Published:
- 01 March 2018
DOI: https://doi.org/10.1007/978-3-319-63962-8_297-1