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

Michael T. Goodrich, Colm Ó’Dúnlaing, Chee K. 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
EditorsFrank Dehne, Jorg-Rudige Sack, Nicola Santoro
PublisherSpringer Verlag
Pages12-23
Number of pages12
ISBN (Print)9783540515425
DOIs
StatePublished - Jan 1 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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Goodrich, M. T., Ó’Dúnlaing, C., & Yap, C. K. (1989). Constructing the Voronoi diagram of a set of line segments in parallel. In F. Dehne, J-R. Sack, & N. Santoro (Eds.), Algorithms and Data Structures - Workshop, WADS 1989, Proceedings (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