@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}{\textquoteright}D{\'u}nlaing and Yap, {Chee K.}",

year = "1989",

doi = "10.1007/3-540-51542-9_3",

language = "English (US)",

isbn = "9783540515425",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "12--23",

editor = "Frank Dehne and Jorg-Rudige Sack and Nicola Santoro",

booktitle = "Algorithms and Data Structures - Workshop, WADS 1989, Proceedings",

note = "Workshop on Algorithms and Data Structures, WADS 1989 ; Conference date: 17-08-1989 Through 19-08-1989",

}