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 inO(log2 n) time usingO(n) processors in the CREW PRAM model.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Agarwal, B. Chazelle, L. Guibas, C. Ó'Dúnlaing, and C. Yap, Parallel Computational Geometry,Algorithmica,3(3) (1988), 293–328.
M. J. Atallah, R. Cole, and M. T. Goodrich, Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms,SIAM J. Comput.,18(3) (1989), 499–532.
M. J. Atallah and M. T. Goodrich, Parallel Algorithms for Some Functions of Two Convex Polygons,Algorithmica,4 (1988), 535–548.
M. J. Atallah and U. Vishkin, Finding Euler Tours in Parallel,J. Comput. System Sci.,29 (1985), 330–337.
H. Blum, A Transformation for Extracting New Descriptors of Shape,Proc. Symp. on Models for Perception of Speech and Visual Form (W. Whaten-Dunn, ed.), M.I.T. Press, Cambridge, MA, 1967, pp. 362–380.
R. Cole, Parallel Merge Sort,SIAM J. Comput.,17(4) (1988), 770–785.
R. Cole, M. T. Goodrich, and C. Ó'Dúnlaing, Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction,Proc. 17th Internat. Conf. on Automata, Languages, and Programming, 1990.
S. Fortune, A Sweepline Algorithm for Voronoi Diagrams,Algorithmica,2 (1987), 153–174.
R. M. Karp and V. Ramachandran, A Survey of Parallel Algorithms for Shared-Memory Machines, inHandbook of Theoretical Computer Science, North-Holland, Amsterdam, to appear.
D. G. Kirkpatrick, Efficient Computation of Continuous Skeletons,Proc. 20th IEEE Symp. on Foundations of Computer Science, 1979, pp. 18–27.
C. P. Kruskal, L. Rudolph, and M. Snir, The Power of Parallel Prefix,Proc. 1985 IEEE Internat. Conf. on Parallel Processing, 1985, pp. 180–185.
R. E. Ladner and M. J. Fischer, Parallel Prefix Computation,J. Assoc. Comput. Mach,27 (1980), 831–838.
D. T. Lee, Medial Axis Transformation of a Planar Shape,IEEE Trans. Pattern Anal. Mach. Intell.,4(4) (1982), 363–369.
D. T. Lee and R. L. Drysdale, III, Generalization of Voronoi Diagrams in the Plane,SIAM J. Comput.,10(1) (1981), 73–87.
J. S. B. Mitchell, On Maximum Flows in Polyhedral Domains,Proc. 4th ACM Symp. on Comput. Geometry, 1988, pp. 341–351.
C. Ó'Dúnlaing and C. Yap, A “Retraction” Method for Planning the Motion of a Disc,J. Algorithms,6 (1985), 104–111.
F. P. Preparata, The Medial Axis of a Simple Polygon,Proc. 6th Symp. on Mathematical Foundations of Computer Science, 1977, pp. 443–450.
M. I. Shamos, Geometric Complexity,Proc. 7th ACM Symp. on Theory of Computing, 1975, pp. 224–233.
H. Wagener, Optimally Parallel Algorithms for Convex Hull Determination, unpublished manuscript, September 1985.
J. C. Wyllie, The Complexity of Parallel Computation, Ph.D. thesis, Technical Report TR 79-387, Department of Computer Science, Cornell University, 1979.
C. K. Yap, AnO(n logn) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments,Discrete Comput. Geom.,2 (1987), 365–393.
Author information
Authors and Affiliations
Additional information
Communicated by Bernard Chazelle.
The research of M. T. Goodrich was supported by NSF under Grants CCR-8810568 and CCR-9003299 and by NSF/DARPA under Grant CCR-8908092. C. K. Yap's research was supported in part by NSF Grants DCR-8401898 and CCR-9002819.
Rights and permissions
About this article
Cite this article
Goodrich, M.T., Ó'Dúnlaing, C. & Yap, C.K. Constructing the Voronoi diagram of a set of line segments in parallel. Algorithmica 9, 128–141 (1993). https://doi.org/10.1007/BF01188708
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01188708