Fast randomized parallel methods for planar convex hull construction

Computational Geometry: Theory and Applications

Volumn 7, Issue 4, 1997, Pages 219-235

  Ghouse, Mujtaba R ^a   Goodrich, Michael T ^b  

^a Quintus Corporation   (United States)

^b Johns Hopkins University   (United States)

Author keywords

Computational geometry; Convex hulls; CRCW PRAM; Parallel algorithms; Randomization

Indexed keywords

EID: 0347767845     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(95)00036-4     Document Type: Article

References (29)

1. A. Aggarwal, B. Chazelle, L. Guibas, C. Ó'Dúnlaing and C. Yap, Parallel computational geometry, Algorithmica 3 (1988) 293-327.
2. N. Alon and N. Megiddo, Parallel linear programming in fixed dimension almost surely in constant time, in: Proc. 31st IEEE Symp. Found. Comput. Sci. (1990) 574-582.
3. M.J. Atallah and M.T. Goodrich, Efficient parallel solutions to some geometric problems, J. Parallel Distrib. Comput. 3 (1986) 492-507.
4. M.J. Atallah and M.T. Goodrich, Parallel algorithms for some functions of two convex polygons, Algorithmica 3 (1988) 535-548.
5. O. Berkman, B. Schieber and U. Vishkin, A fast parallel algorithm for finding the convex hull of a sorted point set, Internat. J. Comput. Geom. Appl., to appear.
6. B. Chazelle and J. Matoušek, Derandomizing an output-sensitive convex hull algorithm in three dimensions, Technical Report, Department of Computer Science, Princeton University, 1992.
7. D. Chen, Efficient geometric algorithms on the EREW PRAM, IEEE Trans. Parallel Distrib. Syst. 6 (1) (1995) 41-47.
8. H. Chernoff, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of the observations, Annals of Math. Stat. 23 (1952) 493-509.
9. A.L. Chow, Parallel algorithms for geometric problems, Ph.D. Thesis, Department of Computer Science, University of Illinois, Urbana, IL, 1980.
10. A.L. Chow, A parallel algorithm for determining convex hulls of sets of points in two dimensions, in: Proc. 19th Allerton Conf. Commun. Control Comput. (1981) 214-223.
11. X. Deng, An optimal parallel algorithm for linear programming in the plane, Inform. Process. Lett. 35 (1990) 213-217.
12. H. Edelsbrunner, Algorithms in Combinatorial Geometry, EATCS Monographs on Theoretical Computer Science, Vol. 10 (Springer, Heidelberg, 1987).
13. D. Eppstein and Z. Galil, Parallel algorithmic techniques for combinatorial computation, Annual Review of Computer Science 3 (1988) 233-283.
14. M. Ghouse and M.T. Goodrich, In-place techniques for parallel convex hull algorithms, in: Proc. 3rd ACM Symp. Parallel Algorithms Architect. (1991) 192-203.
15. M.T. Goodrich, Finding the convex hull of a sorted point set in parallel, Inform. Process. Lett. 26 (1987) 176-179.
16. M.T. Goodrich, Constructing the convex hull of a partially sorted set of points, Computational Geometry: Theory and Applications 2 (5) (1993) 267-278.
17. M.T. Goodrich, Y. Matias and U. Vishkin, Optimal parallel approximation for prefix sums and integer sorting, in: Proc. 5th ACM-SIAM Symp. on Discrete Algorithms (1994) 241-250.
18. R.L. Graham, An efficient algorithm for determining the convex hull of a finite planar set, Inform. Process. Lett. 1 (1972) 132-133.
19. T. Hagerup and C. Rub, Optimal merging and sorting on the erew pram, Inform. Process. Lett. 33 (1989) 181-185.
20. T. Hagerup and C. Rub, A guided tour of Chernoff bounds, Inform. Process. Lett. 33 (1989/90) 305-308.
21. J. Jájá, An Introduction to Parallel Algorithms (Addison-Wesley, Reading, MA, 1992).
22. D.G. Kirkpatrick and R. Seidel, The ultimate planar convex hull algorithm? SIAM J. Comput. 15 (1986) 287-299.
23. Y. Matias and U. Vishkin, Converting high probability into nearly-constant time - with applications to parallel hashing, in: Proc. 23rd ACM Symp. Theory Comput. (1991) 307-316.
24. R. Miller and Q.F. Stout, Efficient parallel convex hull algorithms, IEEE Trans. Comput. 37 (12) (1988) 1605-1618.
25. J. O'Rourke, Computational Geometry in C (Cambridge University Press, Cambridge, 1994), code and errata available by anonymous ftp from grendel.csc.smith.edu (131.229.64.23), in the directory /pub/compgeo.
26. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction (Springer, New York, 1985).
27. P. Ragde, The parallel simplicity of compaction and chaining, in: Proc. 17th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 443 (Springer, Berlin, 1990) 744-751.
28. S. Sen, Finding an approximate median with high probability in constant parallel time, Inform. Process. Lett. 34 (1990) 77-80.
29. A.C. Yao, A lower bound to finding convex hulls, J. ACM 28 (1981) 780-787.