Optimal, output-sensitive algorithms for constructing planar hulls in parallel

Computational Geometry: Theory and Applications

Volumn 8, Issue 3, 1997, Pages 151-166

  Gupta, Neelima ^a   Sen, Sandeep ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

Computational geometry; Convex hull; Parallel algorithm; Randomized algorithm

Indexed keywords

EID: 0038491529     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(97)00009-6     Document Type: Article

References (39)

1. A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaing and C.-K. Yap, Parallel computational geometry. in: Proc. 25th Annual Sympos. Found. Comput. Sci. (1985) 468-477; also: Algorithmica 3 (3) (1988) 293-327.
2. A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaing and C.-K. Yap, Parallel computational geometry. in: Proc. 25th Annual Sympos. Found. Comput. Sci. (1985) 468-477; also: Algorithmica 3 (3) (1988) 293-327.
3. S. Akl, Optimal algorithms for computing convex hulls and sorting, Computing 33 (1) (1984) 1-11.
4. N.M. Amato, M.T. Goodrich and E.A. Ramos, Parallel algorithms for higher-dimensional convex hulls, in: Proc. 35th Annual Sympos. Found. Comput. Sci. (1994) 683-694.
5. N.M. Amato and F.P. Preparata, The parallel 3D convex hull problem revisited, Internat. J. Comput. Geom. Appl. 2 (2) (1992) 163-173.
6. M.J. Atallah and M.T. Goodrich, Efficient parallel solutions to some geometric problems, J. Parallel Distrib. Comput. 3 (4) (1986) 492-507.
7. M.J. Atallah and M.T. Goodrich, Parallel algorithm for some functions of two convex polygons, Algorithmica 3 (4) (1988) 535-548.
8. H. Bast and T. Hagerup, Fast parallel space allocation, estimation and integer sorting, Technical Report MPI-I-93-123 (June 1993).
9. T.M. Chan, Output-sensitive results on convex hulls, extreme points and related problems, in: Proc. ACM Sympos. Comput. Geom. (1995).
10. T.M.Y. Chan, J. Snoeyink and C.-K. Yap, Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three, in: Proc. 6th ACM-SIAM Sympos. Discrete Algorithms (1995) 282-291.
11. B. Chazelle and D. Dobkin, Intersection of convex objects in two and three dimensions, J. ACM 34 (1) (1987) 1-27.
12. B. Chazelle and J. Fredman, A deterministic view of random sampling and its use in geometry, Combinatorica 10 (3) (1990) 229-249.
13. A.L. Chow, Parallel algorithms for geometric problems, Ph.D. Thesis, Department of Computer Science, University of Illinois, Urbana, IL (1980).
14. K.L. Clarkson and P.W. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom. 4 (1989) 387-421.
15. R. Cole, An optimal efficient selection algorithm, Inform. Process. Lett. 26 (1987/1988) 295-299.
16. N. Dadoun and D.G. Kirkpatrick, Parallel construction of subdivision hierarchies, J. Comput. Syst. Sci. 39 (1989) 153-165.
17. X. Deng, An optimal parallel algorithm for linear programming in the plane, Inform. Process. Lett. 35 (1990) 213-217.
18. H. Edelsbrunner, Algorithms in Combinatorial Geometry (Springer, New York, 1987).
19. M. Ghouse and M.T. Goodrich, In-place techniques for parallel convex-hull algorithm, in: Proc. 3rd ACM Sympos. Parallel Algorithms Arch. (1991) 192-203.
20. T. Goldberg and U. Zwick, Optimal deterministic approximate parallel prefix sums and their applications, in: Proc. Israel Sympos. Theory Comput. Systems (ISTCS '95) (1995) 220-228.
21. M. Goodrich, Geometric partitioning made easier, even in parallel, in: Proc. 9th ACM Sympos. Comput. Geom. (1993) 73-82.
22. M. Goodrich, Fixed-dimensional parallel linear programming via relative ε-approximations, in: Proc. Sympos. Discrete Algorithms (1996) 1-10.
23. R. L. Graham, An efficient algorithm for determining the convex hull of a finite planar set, Inform. Process. Lett. 1 (1972) 132-133.
24. N. Gupta and S. Sen, Faster output-sensitive parallel convex hulls for d ≤ 3: optimal sublogarithmic algorithms for small outputs, in: Proc. ACM Sympos. Comput. Geom. (1996) 176-185.
25. T. Hagerup, Fast deterministic processor allocation, in: Proc. 4th ACM Sympos. Discrete Algorithms (1993) 1-10.
26. T. Hagerup and R. Raman, Waste makes haste: Tight bounds for loose, parallel sorting, in: Proc. 33rd Annual Sympos. Found. Comput. Sci. (1992) 628-637.
27. D. Haussler and E. Welzl, ε-nets and simplex range queries, Discrete Comput. Geom. 2 (1987) 127-152.
28. S. Kapoor and P. Ramanan, Lower bounds for maximal and convex layer problems, Algorithmica (1989) 447-459.
29. D.G. Kirkpatrick and R. Seidel, The ultimate planar convex hull algorithm? SIAM J. Comput. 15 (1) (1986) 287-299.
30. Converting high probability into nearly constant time - with applications to parallel hashing, in: Proc 23rd ACM Sympos. Theory Comput. (1991) 307-316.
31. F.P. Preparata, An optimal real time algorithm for planar convex hulls, Comm. ACM 22 (1979) 402-405.
32. F.P. Preparata and S.J. Hong, Convex hulls of finite sets of points in two and three dimensions, Comm. ACM 20 (1977) 87-93.
33. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction (Springer, New York, 1985).
34. S. Rajasekaran and S. Sen, in: J.H. Reif, Ed., Random Sampling Techniques and Parallel Algorithm Design (Morgan Kaufmann Publishers, San Mateo, CA, 1993).
35. J.H. Reif and S. Sen, Optimal parallel randomized algorithms for three-dimensional convex hulls and related problems, SIAM J. Comput. 21 (3) (1992) 466-485.
36. J.H. Reif and S. Sen, Randomized algorithms for binary search and Load Balancing on fixed connection networks with geometric applications, SIAM J. Comput. 23 (3) (1994) 633-651.
37. S. Sen, Lower bounds for algebraic decision trees, complexity of convex hulls and related problems, in: Proc. 14th FST&TCS, Madras, India (1994) 193-204.
38. S. Sen, Parallel multidimensional search using approximation algorithms: with applications to linear-programming and related problems, in: Proc. ACM Sympos. Parallel Algorithms and Architectures (1996) 251-260.
39. M.I. Shamos, Computational geometry, Ph.D. Thesis, Yale University, New Haven (1978).