Parallel computational geometry

A. Aggarwal, B. Chazelle, L. Guibas, C. Ó'Dúnlaing, Chee 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 (New York)
Volume3
Issue number1-4
DOIs
StatePublished - Nov 1988

Fingerprint

Computational geometry
Simple Polygon
Voronoi Diagram
Computational Geometry
Line segment
Parallel algorithms
Convex Hull
Parallel Algorithms
Data structures
Triangle
Data Structures
Efficient Algorithms
Intersection
Query
Three-dimensional

Keywords

  • Computational geometry
  • Data structures
  • Parallel algorithms

ASJC Scopus subject areas

  • Applied Mathematics
  • Safety, Risk, Reliability and Quality
  • Software
  • Computer Graphics and Computer-Aided Design

Cite this

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

Parallel computational geometry. / Aggarwal, A.; Chazelle, B.; Guibas, L.; Ó'Dúnlaing, C.; Yap, Chee.

In: Algorithmica (New York), Vol. 3, No. 1-4, 11.1988, p. 293-327.

Research output: Contribution to journalArticle

Aggarwal, A, Chazelle, B, Guibas, L, Ó'Dúnlaing, C & Yap, C 1988, 'Parallel computational geometry', Algorithmica (New York), vol. 3, no. 1-4, pp. 293-327. https://doi.org/10.1007/BF01762120
Aggarwal A, Chazelle B, Guibas L, Ó'Dúnlaing C, Yap C. Parallel computational geometry. Algorithmica (New York). 1988 Nov;3(1-4):293-327. https://doi.org/10.1007/BF01762120
Aggarwal, A. ; Chazelle, B. ; Guibas, L. ; Ó'Dúnlaing, C. ; Yap, Chee. / Parallel computational geometry. In: Algorithmica (New York). 1988 ; Vol. 3, No. 1-4. pp. 293-327.
@article{34b19bee2965414a8a1fb19c7f289902,
title = "Parallel computational geometry",
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.",
keywords = "Computational geometry, Data structures, Parallel algorithms",
author = "A. Aggarwal and B. Chazelle and L. Guibas and C. {\'O}'D{\'u}nlaing and Chee Yap",
year = "1988",
month = "11",
doi = "10.1007/BF01762120",
language = "English (US)",
volume = "3",
pages = "293--327",
journal = "Algorithmica",
issn = "0178-4617",
publisher = "Springer New York",
number = "1-4",

}

TY - JOUR

T1 - Parallel computational geometry

AU - Aggarwal, A.

AU - Chazelle, B.

AU - Guibas, L.

AU - Ó'Dúnlaing, C.

AU - Yap, Chee

PY - 1988/11

Y1 - 1988/11

N2 - 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.

AB - 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.

KW - Computational geometry

KW - Data structures

KW - Parallel algorithms

UR - http://www.scopus.com/inward/record.url?scp=52449145273&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=52449145273&partnerID=8YFLogxK

U2 - 10.1007/BF01762120

DO - 10.1007/BF01762120

M3 - Article

VL - 3

SP - 293

EP - 327

JO - Algorithmica

JF - Algorithmica

SN - 0178-4617

IS - 1-4

ER -