Algorithmica

, Volume 3, Issue 1, pp 293–327

Parallel computational geometry

  • A. Aggarwal
  • B. Chazelle
  • L. Guibas
  • C. Ó'Dúnlaing
  • C. Yap
Article

DOI: 10.1007/BF01762120

Cite this article as:
Aggarwal, A., Chazelle, B., Guibas, L. et al. Algorithmica (1988) 3: 293. doi:10.1007/BF01762120

Abstract

We present efficient parallel algorithms for several basic problems in computational geometry: convex hulls, Voronoi diagrams, detecting line segment intersections, triangulating simple polygons, minimizing a circumscribing triangle, and recursive data-structures for three-dimensional queries.

Key words

Parallel algorithmsComputational geometryData structures

Copyright information

© Springer-Verlag New York Inc. 1988

Authors and Affiliations

  • A. Aggarwal
    • 1
  • B. Chazelle
    • 2
  • L. Guibas
    • 3
    • 4
  • C. Ó'Dúnlaing
    • 5
    • 6
  • C. Yap
    • 5
  1. 1.IBM Thomas J. Watson Research CenterYorktown HeightsUSA
  2. 2.Department of Computer SciencePrinceton UniversityPrincetonUSA
  3. 3.Digital Equipment Corporation Systems Research LaboratoriesPalo AltoUSA
  4. 4.Computer Science DepartmentStanford UniversityStanfordUSA
  5. 5.Courant Institute of Mathematical SciencesNew York UniversityNew YorkUSA
  6. 6.School of MathematicsTrinity CollegeRepublic of Ireland