Parallel computational geometry

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

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)293-327
Number of pages35
JournalAlgorithmica
Volume3
Issue number1
DOIs
StatePublished - Mar 1988

Keywords

  • Computational geometry
  • Data structures
  • Parallel algorithms

ASJC Scopus subject areas

  • Computer Science(all)
  • Computer Science Applications
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Parallel computational geometry'. Together they form a unique fingerprint.

  • Cite this

    Aggarwal, A., Chazelle, B., Guibas, L., Ó'Dúnlaing, C., & Yap, C. (1988). Parallel computational geometry. Algorithmica, 3(1), 293-327. https://doi.org/10.1007/BF01762120