Constructing the Voronoi diagram of a set of line segments in parallel

Michael T. Goodrich, Colm Ó’Dúnlaing, Chee Yap

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

Abstract

In this paper we give a parallel algorithm for constructing the Voronoi diagram of a polygonal scene, i.e., a set of line segments in the plane such that no two segments intersect except possibly at their endpoints. Our algorithm runs in O(log2n) time using O(n) processors in the CREW PRAM model.

Original languageEnglish (US)
Title of host publicationAlgorithms and Data Structures - Workshop, WADS 1989, Proceedings
PublisherSpringer Verlag
Pages12-23
Number of pages12
Volume382 LNCS
ISBN (Print)9783540515425
DOIs
StatePublished - 1989
EventWorkshop on Algorithms and Data Structures, WADS 1989 - Ottawa, Canada
Duration: Aug 17 1989Aug 19 1989

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume382 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherWorkshop on Algorithms and Data Structures, WADS 1989
CountryCanada
CityOttawa
Period8/17/898/19/89

Fingerprint

Voronoi Diagram
Line segment
Intersect
Parallel algorithms
Parallel Algorithms
Model

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Goodrich, M. T., Ó’Dúnlaing, C., & Yap, C. (1989). Constructing the Voronoi diagram of a set of line segments in parallel. In Algorithms and Data Structures - Workshop, WADS 1989, Proceedings (Vol. 382 LNCS, pp. 12-23). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 382 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-51542-9_3

Constructing the Voronoi diagram of a set of line segments in parallel. / Goodrich, Michael T.; Ó’Dúnlaing, Colm; Yap, Chee.

Algorithms and Data Structures - Workshop, WADS 1989, Proceedings. Vol. 382 LNCS Springer Verlag, 1989. p. 12-23 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 382 LNCS).

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

Goodrich, MT, Ó’Dúnlaing, C & Yap, C 1989, Constructing the Voronoi diagram of a set of line segments in parallel. in Algorithms and Data Structures - Workshop, WADS 1989, Proceedings. vol. 382 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 382 LNCS, Springer Verlag, pp. 12-23, Workshop on Algorithms and Data Structures, WADS 1989, Ottawa, Canada, 8/17/89. https://doi.org/10.1007/3-540-51542-9_3
Goodrich MT, Ó’Dúnlaing C, Yap C. Constructing the Voronoi diagram of a set of line segments in parallel. In Algorithms and Data Structures - Workshop, WADS 1989, Proceedings. Vol. 382 LNCS. Springer Verlag. 1989. p. 12-23. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-51542-9_3
Goodrich, Michael T. ; Ó’Dúnlaing, Colm ; Yap, Chee. / Constructing the Voronoi diagram of a set of line segments in parallel. Algorithms and Data Structures - Workshop, WADS 1989, Proceedings. Vol. 382 LNCS Springer Verlag, 1989. pp. 12-23 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{ef48137f3dd7452ab397f9299e411e6b,
title = "Constructing the Voronoi diagram of a set of line segments in parallel",
abstract = "In this paper we give a parallel algorithm for constructing the Voronoi diagram of a polygonal scene, i.e., a set of line segments in the plane such that no two segments intersect except possibly at their endpoints. Our algorithm runs in O(log2n) time using O(n) processors in the CREW PRAM model.",
author = "Goodrich, {Michael T.} and Colm {\'O}’D{\'u}nlaing and Chee Yap",
year = "1989",
doi = "10.1007/3-540-51542-9_3",
language = "English (US)",
isbn = "9783540515425",
volume = "382 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "12--23",
booktitle = "Algorithms and Data Structures - Workshop, WADS 1989, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Constructing the Voronoi diagram of a set of line segments in parallel

AU - Goodrich, Michael T.

AU - Ó’Dúnlaing, Colm

AU - Yap, Chee

PY - 1989

Y1 - 1989

N2 - In this paper we give a parallel algorithm for constructing the Voronoi diagram of a polygonal scene, i.e., a set of line segments in the plane such that no two segments intersect except possibly at their endpoints. Our algorithm runs in O(log2n) time using O(n) processors in the CREW PRAM model.

AB - In this paper we give a parallel algorithm for constructing the Voronoi diagram of a polygonal scene, i.e., a set of line segments in the plane such that no two segments intersect except possibly at their endpoints. Our algorithm runs in O(log2n) time using O(n) processors in the CREW PRAM model.

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

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

U2 - 10.1007/3-540-51542-9_3

DO - 10.1007/3-540-51542-9_3

M3 - Conference contribution

AN - SCOPUS:84983639860

SN - 9783540515425

VL - 382 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 12

EP - 23

BT - Algorithms and Data Structures - Workshop, WADS 1989, Proceedings

PB - Springer Verlag

ER -