A Nearly Optimal Deterministic Parallel Voronoi Diagram Algorithm

Algorithmica (New York)

Volumn 16, Issue 6, 1996, Pages 569-617

  Cole, R ^a   Goodrich, M T ^b   Dunlaing C O ^c  

^a NEW YORK UNIVERSITY   (United States)

^b Johns Hopkins University   (United States)

^c TRINITY COLLEGE DUBLIN   (Ireland)

Author keywords

Parallel algorithm; Voronoi diagram

Indexed keywords

EID: 0141878573     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf01944352     Document Type: Article

References (28)

1. A. Aggarwal, B. Chazelle, L. Guibas, C. Ó Dúnlaing, and C. Yap (1988). Parallel computational geometry. Algorithmica, 3(3), 293-328.
2. M. J. Atallah (1985). Some dynamic computational geometry problems. Computers and Mathematics with Applications, 11, 1171-1181.
3. M. J. Atallah, R. Cole, and M. T. Goodrich (1989). Cascading divide-and-conquer: a technique for designing parallel algorithms. SIAM Journal on Computing, 18(3), 499-532.
4. M. J. Atallah and M. T. Goodrich (1988). Parallel algorithms for some functions of two convex polygons. Algorithmica, 3, 535-548.
5. F. Aurenhammer (1990). Voronoi Diagrams - a Survey of a Fundamental Geometric Data Structure. Technical report, FB Mathematik Serie B, Freie Universität Berlin.
6. P. Bhatt, K. Diks, T. Hagerup, V. Prasad, T. Radzik, and S. Saxena (1991). Improved deterministic parallel integer sorting. Information and Computation, 94, 29-47.
7. L. Boxer and R. Miller (1989). Parallel dynamic computational geometry. Journal of New Generation Computer Systems, 2(3), 227-246.
8. A. Chow (1980). Parallel Algorithms for Geometric Problems. Ph.D. thesis, Computer Science Department, University of Illinois.
9. R. Cole, M. Goodrich, and C. Ó Dúnlaing (1990). Merging free trees in parallel for efficient Voronoi diagram construction. Proc. 17th ICALP. LNCS, vol. 443. Springer-Verlag, Berlin, pp. 432-445.
10. D. Evans and I. Stojmenović (1989). On parallel computation of Voronoi diagrams. Parallel Computing, 12, 121-125.
11. A. Farrell (1994). Fortune's Voronoi sweepline algorithm for convex sites. M.Sc. dissertation, Department of Mathematics, Trinity College, Dublin.
12. F. Fich (1993). The complexity of computation on the parallel random access machine. In Synthesis of Parallel Algorithms, ed. J. Reif. Morgan Kaufmann, Los Altos, CA.
13. F. Fich and V. Ramachandran (1990). Lower bounds for parallel computation on linked structures. Proc. Annual ACM Symp. on Parallel Algorithms and Architectures, Crete, pp. 109-116.
14. S. Fortune (1987). A sweep-line algorithm for Voronoi diagrams. Algorithmica, 2(2), 153-174.
15. M. T. Goodrich, C. Ó Dúnlaing, and C. Yap (1993). Constructing the Voronoi diagram of a set of line segments in parallel. Algorithmica, 9, 128-141.
16. M. Greenberg and J. Harper (1981). Algebraic Topology - A First Course. Benjamin/Cummings, Menlo Park, CA.
17. L. Guibas and J. Stolfi (1985). Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Transactions on Graphics, 4, 74-123.
18. C. Kruskal (1983). Searching, merging, and sorting in parallel computation. IEEE Transactions on Computers, 32(10), 942-946.
19. C. P. Kruskal, L. Rudolph, and M. Snir (1985). The power of parallel prefix. 1985 Internat. Conf. on Parallel Processing, pp. 180-185.
20. R. E. Ladner and M. J. Fischer (1980). Parallel prefix computation. Journal of the Association for Computing Machinery, 27, 831-838.
21. E. Moise (1977). Geometric Topology in Dimensions 2 and 3. Graduate Texts in Mathematics, No. 47. Springer-Verlag, New York.
22. C. Ó Dúnlaing (1993). Parallel computational geometry. In Lectures on Parallel Computation, ed. A. Gibbons and P. Spirakis. Cambridge International Series on Parallel Computation, Vol. 4. Cambridge University Press, Cambridge, pp. 77-108.
23. I. Parberry (1987). On the time required to sum n semigroup elements on a parallel machine with simultaneous writes. Theoretical Computer Science, 51, 239-247.
24. J. H. Reif and S. Sen (1992). Optimal parallel algorithms for 3-dimensional convex hulls and related problems. SIAM Journal on Computing, 21(3), 466-485.
25. M. I. Shamos and D. Hoey (1975). Closest-point problems. Proc. 15th IEEE Symp. on Foundations of Computer Science, pp. 151-162.
26. R. Tarjan (1983). Data Structures and Network Algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics, No. 44. SIAM, Philadelphia, PA.
27. L. Valiant (1975). Parallelism in comparison problems. SIAM Journal on Computing, 4(3), 348-355.
28. H. Wagener (1985). Optimally Parallel Algorithms for Convex Hull Determination. Manuscript, Technical University of Berlin.