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.
Cite
CITATION STYLE
APA
Goodrich, M. T., Ó’Dúnlaing, C., & Yap, C. K. (1989). Constructing the Voronoi diagram of a set of line segments in parallel. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 382 LNCS, pp. 12–23). Springer Verlag. https://doi.org/10.1007/3-540-51542-9_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free