PARALLEL COMPUTATIONAL GEOMETRY.

Alok Aggarwal, Bernard Chazelle, Leo Guibas, Colm O'Dunlaing, Chee Yap

Research output: Chapter in Book/Report/Conference proceedingConference contribution

55 Scopus citations

Abstract

The authors provide almost optimal parallel algorithms in the following areas of computational geometry: (1) convex hulls in two and three dimensions; (2) Voronoi diagrams and proximity problems; (3) detecting segment intersections and triangulating a polygon; (4) geometric optimization problems; and (5) creating data structures in two and three dimensions to answer some standard queries.

Original languageEnglish (US)
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherIEEE
Pages468-477
Number of pages10
ISBN (Print)0818606444, 9780818606441
DOIs
StatePublished - Jan 1 1985
Externally publishedYes

Publication series

NameAnnual Symposium on Foundations of Computer Science (Proceedings)
ISSN (Print)0272-5428

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'PARALLEL COMPUTATIONAL GEOMETRY.'. Together they form a unique fingerprint.

  • Cite this

    Aggarwal, A., Chazelle, B., Guibas, L., O'Dunlaing, C., & Yap, C. (1985). PARALLEL COMPUTATIONAL GEOMETRY. In Annual Symposium on Foundations of Computer Science (Proceedings) (pp. 468-477). (Annual Symposium on Foundations of Computer Science (Proceedings)). IEEE. https://doi.org/10.1109/sfcs.1985.42