Parallel algorithms for higher-dimensional convex hulls

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 1994, Pages 683-694

  Amato, Nancy M ^a   Goodrich, Michael T ^b   Ramos, Edgar A ^c  

^a TEXAS A AND M UNIVERSITY   (United States)

^b JOHNS HOPKINS UNIVERSITY   (United States)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

3-DIMENSIONAL; CONVEX HULL; CONVEX HULL ALGORITHM; DETERMINISTICS; HIGH PROBABILITY; HIGH-DIMENSIONAL; HIGHER-DIMENSIONAL; PARALLEL METHOD; RUNNING TIME; SHARED MEMORY MODEL;

COMPUTATIONAL GEOMETRY;

EID: 0002530128     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1994.365724     Document Type: Conference Paper

References (58)

1. P. K. Agarwal, M. Sharir, and S. Toledo. Applications of parametric searching in geometric optimization. In Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms, pages 72-82, 1992.
2. A. Aggarwal. B. Chazelle, L. Guibas, C. Dunlaing, and C. Yap. Parallel computational geometry. Algorithmica, 3:293-327, 1988.
3. N. M. Amato and F. P. Preparata. The parallel 3D convex hull problem revisited. Internal J. Compul. Geom. Appi, 2(2): 163-173, 1992.
4. N. M. Amato and F. P. Preparata. An NC' parallel 3D convex hull algorithm. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 289-297, 1993.
5. P. Assouad. Densite et dimension. Ann. Inst. Fourier, Grenoble, 3:232-282, 1983.
6. M. J. Atallah and M. T. Goodrich. Efficient parallel solutions to some geometric problems. J. Parallel Distrib. Comput., 3:492-507, 1986.
7. M. J. Atallah and M. T. Goodrich. Parallel algorithms for some functions of two convex polygons. Algorithmica, 3:535-548, 1988.
8. Herve Brbnnimann, Bernard Chazelle, and Jiri Matousek. Product range spaces, sensitive sampling, and derandomization. In Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci. (FOCS93), pages 400-409, 1993.
9. B. Chazelle. Cutting hyperplanes for divide-and-conquer. Discrete Comput. Geom., 9(2):145-158, 1993.
10. B. Chazelle. An optimal convex hull algorithm in any fixed dimension. Discrete Comput. Geom., 10:377-409, 1993.
11. B. Chazelle, H. Edelsbrunner. L. Guibas, and M. Sharir. Diameter, width, closest line pair and parametric searching. Discrete Comput. Geom., 10:183-196, 1993.
12. B. Chazelle and J. Friedman. A deterministic view of random sampling and its use in geometry. Combinatorial, 10(3):229-249, 1990.
13. B. Chazelle and J. Matousek. Derandomizing an output-sensitive convex hull algorithm in three dimensions. Technical report, Dept. Comput. Sci., Princeton Univ., 1992.
14. A. L. Chow. Parallel algorithms for geometric problems. Ph.D. thesis, Dept. Comput. Sci., Univ. Illinois, Urbana, IL, 1980.
15. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
16. R. Cole. Slowing down sorting networks to obtain faster sorting algorithms./ACM, 34:200-208, 1987.
17. R.Cole. Parallel merge sort. SIAMJ. Comput., 17(4)770-785, 1988.
18. R. Cole and U. Vishkin. Approximate parallel scheduling, part i: the basic technique with applications to optimal parallel list ranking in logarithmic time. SIAM Journal on Computing, 17(1):128-142, 1988.
19. S. A. Cook, C. Dwork, and R. Reischuk. Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAMJ. Comput., 15:87-97, 1986.
20. N. Dadoun and D. G. Kirkpatrick. Parallel construction of subdivision hierarchies. J. Comput. Syst. Sci., 39:153-165. 1989.
21. D. P. Dobkin and R. J. Lipton. Multidimensional searching problems. SIAMJ. Comput.. 5:181-186, 1976.
22. D.P. Dobkin and D.G. Kirkpatrick. Fast detection of polyhedral intersection. Theoretical Computer Science, 27:241-253, 1983.
23. H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1987.
24. H. Edelsbrunner and E. Miicke. Three-dimensional alpha shapes. ACM Trans, on Graphics, 1994. To appear.
25. M. Ghouse and M. T. Goodrich. In-place techniques for parallel convex hull algorithms. In Proc. 3rd ACM Sympos. Parallel Algorithms Architect., pages 192-203, 1991.
26. M. T. Goodrich. Constructing arrangements optimally in parallel. Discrete Comput. Geom., 9:371-385, 1993.
27. M. T. Goodrich. Geometric partitioning made easier, even in parallel. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 73-82, 1993.
28. R. L. Graham. An efficient algorithm for determining the convex hull of a finite planar set. Inform. Process. Lett.. 1:132-133, 1972.
29. T. Hagerup and C. Rub. A guided tour of Chernoff bounds. Information Processing Letters, 33(10):305-308, 1990.
30. D. Haussler and E. Welzl. Epsilon-nets and simplex range queries. Discrete Comput. Geom., 2:127-151, 1987.
31. A. Heppes. Beweis einer vermutung von a. vazsonyi. Acta Math. Acad. Sci. Hungar., 7:463-466, 1956.
32. H. Karloff and Y. Mansour. On construction of fc-wise independent random variables. In Proc. ACM Sympos. Theorv of Computing, pages 564-573, 1994.
33. D. G. Kirkpatrick and R. Seidel. The ultimate planar convex hull algorithm? SIAMJ. Comput., 15:287-299, 1986.
34. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAMJ. Comput., 15(4):1036-1053. 1986.
35. M. Luby. Removing randomness in parallel computation without a processor penalty. In Proc. IEEE Sympos. Foundations of Computer Science, pages 162-173, 1988.
36. Y. Matias and U. Vishkin. Converting high probability into nearly-constant time-with applications to parallel hashing. In 23rd ACM Symp. on Theory of Computing, pages 307-316. 1991.
37. J. Matousek. Approximations and optimal geometric divide-and-conquer. In Proc. 23rd Annu. ACM Sympos. Theory Comput., pages 505-511, 1991. Also to appear in J. Comput. Syst. Sci.
38. J. Matousek. Cutting hyperplane arrangements. Discrete Comput. Geom., 6:385-406, 1991.
39. J. Matousek. Reporting points in halfspaces. Comput. Geom. Theory App/.,2(3):169-186, 1992.
40. J. Matousek and O. Schwarzkopf. A deterministic algorithm for the three-dimensional diameter problem. In Proc. 25th Annu. ACM Sympos. Theory Comput., pages 478-484, 1993.
41. J. Matousek. Efficient partition trees. Discrete Comput. Geom., 8:315-334, 1992.
42. J. Matousek. Linear optimization queries. J. Algorithms, 14:432-448, 1993.
43. The results combined with results of O. Schwarzkopf also appear in Proc. 8th ACM Sympos. Comput. Geom., 1992, pages 16-25.
44. N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. J. ACM, 30:852-865, 1983.
45. R. Miller and Q. F. Stout. Efficient parallel convex hull algorithms. IEEE Trans. Comput., C-37(12):1605-1618, 1988.
46. W. Paul, U. Vishkin, and H. Wagener. Parallel dictionaries on 2-3 trees. In Proceedings of the Tenth ICALP, pages 597-609, 1983.
47. M. Pellegrini. On point location and motion planning among simplicies. In Proc. ACM Sympos. Theory of Computing, pages 95-104, 1994.
48. F. P. Preparata and S. J. Hong. Convex hulls of finite sets of points in two and three dimensions. Commun. ACM, 20:87-93, 1977.
49. F. P. Preparata and M. I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, New York, NY, 1985.
50. S. Rajasekaran and S. Ramaswami. Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane and related problems. In Proc. 10th Annu. ACM Sympos. Comput. Geom., 1994.
51. 3. Technical Report UIUCDCS-R-94-1851, Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1994.
52. J.H. Reif and S. Sen. Optimal parallel randomized algorithms for three-dimensional convex hulls and related problems. SIAM J. Corn-put., 21(3):46fr485, 1992.
53. J.H. Reif and S.Sen. Randomized algorithms for binary search and load balancing on fixed connection networks with geometric applications. In Proc. 2nd ACM Sympos. Parallel Algorithms Architect., pages 327-337, 1990.
54. N. Sauer. On the density of families of sets. J. Combin. Theory Ser. A, 13:145-147, 1972.
55. R. Seidel. A convex hull algorithm optimal for point sets in even dimensions. M.Sc. thesis, Dept. Comput. Sci., Univ. British Columbia, Vancouver, BC, 1981. Report 81/14.
56. R. Seidel. Constructing higher-dimensional convex hulls at logarithmic cost per face. In Proc. 18th Annu. ACM Sympos. Theory Comput., pages 404-413, 1986.
57. R. Seidel. Small-dimensional linear programming and convex hulls made easy. Discrete Comput. Geom., 6.423-434, 1991.
58. V. N. Vapnik and A. Y. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appi. 16:264-280, 1971.