Parallel computational geometry

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

doi:10.1007/BF01762120

Parallel computational geometry

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

Computer Science

Research output: Contribution to journal › Article › peer-review

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 language	English (US)
Pages (from-to)	293-327
Number of pages	35
Journal	Algorithmica
Volume	3
Issue number	1-4
DOIs	https://doi.org/10.1007/BF01762120
State	Published - Nov 1988

Keywords

Computational geometry
Data structures
Parallel algorithms

ASJC Scopus subject areas

General Computer Science
Computer Science Applications
Applied Mathematics

Access to Document

10.1007/BF01762120

Cite this

@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 C. Yap",

year = "1988",

month = nov,

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, C.

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

AN - SCOPUS:52449145273

SN - 0178-4617

VL - 3

SP - 293

EP - 327

JO - Algorithmica

JF - Algorithmica

IS - 1-4

ER -

Parallel computational geometry

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this