Optimal parallel algorithms for polygon and point-set problems (Preliminary Version)

Richard Cole, Michael T. Goodrich

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

Abstract

In this paper we give parallel algorithms for a number of problems defined on polygons and point sets. All of our algorithms have optimal T(n) P(n) products, where T(n) is the time complexity and P(n) is the number of processors used, and are for the EREW PRAM or CREW PRAM models. In addition, our algorithms provide parallel analogues to well known phenomena from sequential computational geometry, such as the fact that problems for polygons can oftentimes be solved more efficiently that point-set problems, and that one can solve nearest-neighbor problems without explicitly constructing a Voronoi diagram.

Original languageEnglish (US)
Title of host publicationProceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988
PublisherAssociation for Computing Machinery, Inc
Pages201-210
Number of pages10
ISBN (Electronic)0897912705, 9780897912709
DOIs
StatePublished - Jan 6 1988
Event4th Annual Symposium on Computational Geometry, SCG 1988 - Urbana-Champaign, United States
Duration: Jun 6 1988Jun 8 1988

Other

Other4th Annual Symposium on Computational Geometry, SCG 1988
CountryUnited States
CityUrbana-Champaign
Period6/6/886/8/88

Fingerprint

Optimal Algorithm
Point Sets
Parallel Algorithms
Polygon
EREW PRAM
Voronoi Diagram
Computational Geometry
Time Complexity
Nearest Neighbor
Analogue
Model

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

Cole, R., & Goodrich, M. T. (1988). Optimal parallel algorithms for polygon and point-set problems (Preliminary Version). In Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988 (pp. 201-210). Association for Computing Machinery, Inc. https://doi.org/10.1145/73393.73414

Optimal parallel algorithms for polygon and point-set problems (Preliminary Version). / Cole, Richard; Goodrich, Michael T.

Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988. Association for Computing Machinery, Inc, 1988. p. 201-210.

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

Cole, R & Goodrich, MT 1988, Optimal parallel algorithms for polygon and point-set problems (Preliminary Version). in Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988. Association for Computing Machinery, Inc, pp. 201-210, 4th Annual Symposium on Computational Geometry, SCG 1988, Urbana-Champaign, United States, 6/6/88. https://doi.org/10.1145/73393.73414
Cole R, Goodrich MT. Optimal parallel algorithms for polygon and point-set problems (Preliminary Version). In Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988. Association for Computing Machinery, Inc. 1988. p. 201-210 https://doi.org/10.1145/73393.73414
Cole, Richard ; Goodrich, Michael T. / Optimal parallel algorithms for polygon and point-set problems (Preliminary Version). Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988. Association for Computing Machinery, Inc, 1988. pp. 201-210
@inproceedings{49acf94cf9a640e59bb27f87b23936be,
title = "Optimal parallel algorithms for polygon and point-set problems (Preliminary Version)",
abstract = "In this paper we give parallel algorithms for a number of problems defined on polygons and point sets. All of our algorithms have optimal T(n) ∗ P(n) products, where T(n) is the time complexity and P(n) is the number of processors used, and are for the EREW PRAM or CREW PRAM models. In addition, our algorithms provide parallel analogues to well known phenomena from sequential computational geometry, such as the fact that problems for polygons can oftentimes be solved more efficiently that point-set problems, and that one can solve nearest-neighbor problems without explicitly constructing a Voronoi diagram.",
author = "Richard Cole and Goodrich, {Michael T.}",
year = "1988",
month = "1",
day = "6",
doi = "10.1145/73393.73414",
language = "English (US)",
pages = "201--210",
booktitle = "Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988",
publisher = "Association for Computing Machinery, Inc",

}

TY - GEN

T1 - Optimal parallel algorithms for polygon and point-set problems (Preliminary Version)

AU - Cole, Richard

AU - Goodrich, Michael T.

PY - 1988/1/6

Y1 - 1988/1/6

N2 - In this paper we give parallel algorithms for a number of problems defined on polygons and point sets. All of our algorithms have optimal T(n) ∗ P(n) products, where T(n) is the time complexity and P(n) is the number of processors used, and are for the EREW PRAM or CREW PRAM models. In addition, our algorithms provide parallel analogues to well known phenomena from sequential computational geometry, such as the fact that problems for polygons can oftentimes be solved more efficiently that point-set problems, and that one can solve nearest-neighbor problems without explicitly constructing a Voronoi diagram.

AB - In this paper we give parallel algorithms for a number of problems defined on polygons and point sets. All of our algorithms have optimal T(n) ∗ P(n) products, where T(n) is the time complexity and P(n) is the number of processors used, and are for the EREW PRAM or CREW PRAM models. In addition, our algorithms provide parallel analogues to well known phenomena from sequential computational geometry, such as the fact that problems for polygons can oftentimes be solved more efficiently that point-set problems, and that one can solve nearest-neighbor problems without explicitly constructing a Voronoi diagram.

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

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

U2 - 10.1145/73393.73414

DO - 10.1145/73393.73414

M3 - Conference contribution

AN - SCOPUS:85030065655

SP - 201

EP - 210

BT - Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988

PB - Association for Computing Machinery, Inc

ER -