Algorithmica

, Volume 3, Issue 1, pp 293–327

Parallel computational geometry

Authors

  • A. Aggarwal
    • IBM Thomas J. Watson Research Center
  • B. Chazelle
    • Department of Computer SciencePrinceton University
  • L. Guibas
    • Digital Equipment Corporation Systems Research Laboratories
    • Computer Science DepartmentStanford University
  • C. Ó'Dúnlaing
    • Courant Institute of Mathematical SciencesNew York University
    • School of MathematicsTrinity College
  • C. Yap
    • Courant Institute of Mathematical SciencesNew York University
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 algorithms Computational geometry Data structures

Copyright information

© Springer-Verlag New York Inc. 1988