Parallel Algorithms for Convex Hull Problems and Their Paradigm

IEICE Transactions on Information and Systems

Volumn E83-D, Issue 3, 2000, Pages 519-529

  Chent, Wei ^a   Nakano, Koji ^a   Wada, Koichi ^a  

^a NAGOYA INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Convex hulls; Output size sensitive algorithms; Parallel algorithms; Randomized algorithms; Robust computational geometry

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; MATHEMATICAL MODELS; RANDOM ACCESS STORAGE; RANDOM PROCESSES;

CONVEX HULL PROBLEMS; MULTICOMPUTERS; OUTPUT SIZE SENSITIVE ALGORITHMS; ROBUST ALGORITHM;

PARALLEL ALGORITHMS;

EID: 0034156790     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (72)

1. A. Aggarwal B. Chazclle L. Guibas C. Ö'Dünlaing and C. Yap Parallel computational geometry Algorithmica vol.3 pp.163-173 1988.
2. N.M. Amato and P.P. Preparata ''The parallel 3D convex hull problem revisited Comput. Geom. Appl. vol.2 no.2 pp.163-173 1992.
3. N.M. Amato M.T. Goodrich and E.A. Ramos Parallel algorithms for higher-dimensional convex hulls Proc. of the 36th Annual Symposium on Foundations of Computer Science pp.G83-G94 1995.
4. N.M. Amato and P.P. Preparata A time-optimal parallel algorithm for three-dimensional convex hulls Algorithmica vol.14 no.2 pp.169-182 1995.
5. M.J. Atallah and D.Z. Chen Optimal parallel hypercube algorithms for polygon problems IEEE Trans. Comput. vol.44 no.7 pp.914-922 1995.
6. M.J. Atallah and D.J. Chen Parallel geometric algorithms in coarse-grain network models Proc. of 4th Annual International Computing and Combinatorics Conference pp.5564 1998.
7. M.J. Atallah and M.T. Goodrich Efficient parallel solutions to some geometric problems J. Parallel Distrib. Comput. vol.3 pp.492-507 1986.
8. M.J. Atallah and M.T. Goodrich Parallel algorithms for some functions of two convex polygons Algorithmica vol.3 pp.535-548 1988.
9. C. Bajaj and M.S. Kim Convex hull of objects bounded by algebraic curves Algorithmic vol.6 pp.533-553 1991.
10. O. Berkman B. Schieber and B. Vishkin A fast parallel algorithm for finding the convex hull of a sorted point set Comput. Geom. Theory Appl. vol.6 no.2 pp.231241 1996.
11. B. Bhatacharya and J.E. Gindy A new linear convex hull algorithm for simple polygons IEEE Trans on Information Theory vol.30 no.l pp.85-88 1984.
12. J.D. Boissonnat A. Cérézo O. Deviller J. Duquesne and M. YvinecAn algorithm for constructing the convex hull of a set of spheres in dimension ci Comput. Geom. Theory Appl. vol.6 pp.123-130 1996.
13. H. Bröonnimann B. Chazcllcl and J. Matousek Product range spaces sensitive sampling and derandomization Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci. pp.400-409 1993.
14. C.D. Castanho W. Chen and K. Wada A parallel algorithm for constructing strongly convex superhulls of points to appear in IEICE Trans. Fundamentals vol.E83A no.4 April 2000.
15. B. Chazellel An optimal convex hull algorithm in any fixed dimension Discrete Comput. Geom. vol.10 pp.377-409 1993.
16. B. Chazellel and J. Matousek Derandomizing an outputsensitive convex hull algorithm in three dimensions Technical Report Dept. Comput. Sci. Univ. Illinois Urbana IL 1980.
17. D.Z.'Chen Efficient geometric algorithms on the EREW PRAM IEEE Trans. Parallel and Distributed Systems vol.6 pp.41-47 1995.
18. \V. Chen X.W. Deng K. Wada and K. Kawaguchi Constructing a strongly convex superhull of points Third Annual International Computing and Combinatorics Conference Lecture Notes in Computer Science no.1276 pp.4-51 1997.
19. W. Chen K. Nakano T. Masuzawa and N. Tokura A parallel method for the prefix convex hulls problem IEICE Trans. Fundamentals vol.E77-A no.10 pp.1675-1683 Oct. 1994.
20. W. Chen K. Nakano T. Masuzawa and N. Tokura Optimal parallel algorithms for finding the convex hull of a sorted point set IEICE Trans. vol.J74-D-I no.12 pp.814-825 Dec. 1991.
21. \V. Chen and K. Wada Multi-level divide-and-conquer: A method for clbsigning efficient parallel algorithms Proc. of 2nd International Conference on Parallel and Distributed Computing and Networks 1998.
22. W. Chen K. Wada and K. Kawaguchi Parallel robust algorithms for constructing strongly convex hulls Proc. of the 12th Annual ACM Symposium on Computational Geometry pp.133-140 1996.
23. W. Chen K. Wada K. Kawaguchi and D.Z. Chen Finding the convex hull of discs in parallel J. of Computational Geometry and Applications vol.8 no.3 pp.305-319 1998.
24. A.L. Chow Parallel algorithms for geometric problems Ph.D. Thesis Dept. Comput. Sci. Univ. Illinois Urbana IL 1980.
25. K.L. Clarkson and P.W. Shor Application of random sampling in computational geometry II Discrete Comput. Geom. vol.4 pp.387-421 1986.
26. S.A. Cook C. Dwork and R. Reischuk Upper and lower time bounds for parallel random access machines without simultaneous writes SIAM J. Comput. vol.15 pp.87-97 198G.
27. N. Dadoun and D.G. Kirkpatrick Parallel construction of subdivision hierarchies Comput. Syst. Sci. vol.39 pp.153-165 1989.
28. F. Dehne X. Deng P. Dymond A. Fabri and A.A. Khokhar A randomized parallel three-dimensional convex hull algorithm for coarse-grained multicomputers Theory Comput. Syst. vol.30 no.G pp.547-558 1997.
29. O. Dcvillers and M.J. Golin Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas Proc. of the 6th Canadian Conference on Computational Geometry pp.153-158 1994.
30. D.P. Dobkin and D.L. Souvaine Computational geometry in a curved world Algorithmica vol.5 pp.421-457 1990.
31. H. Edelsbrunner Algorithms in combinatorial geometry vol.10 of EATCS Monographs on Theoretical Computer Science Springer Verlag Heidelberg West Germany 1987.
32. H. Edelsbrunner and \V. Shi An O(nlog2h) time algorithm for the three-dimensional convex hull problem SIAM J. on Computing vol.20 pp.259-269 1991.
33. A. Ferreira A. Rau-Chaplin and S. Ueda Scalable 2d convex hull and triangulation algorithms for coarse grained multicomputers Proc. of 7th IEEE Symposium on Parallel and Distributed Processing pp.501-568 1995.
34. P-O. Fjällström J. Katajainen C. Levcopoulos and O. Petersson A sublogarithmic convex hull algorithm Bit vol.30 pp.378-384 1990.
35. S. Fortune Stable maintenance of point set triangulations in two dimensions Proc. of the 30th Annu. Sympos. on Foundations of Computer Science pp.494-499 1989.
36. M. Ghouse and M.T. Goodrich In-place techniques for parallel convex hull algorithms in Proc. 3rd ACM Sympos. Parallel Algorithms Architect. pp.192-203 1991.
37. M.T. Goodrich Finding the convex hull of a sorted point set in parallel Information Processing Letters vol.26 pp.173-179 1987.
38. M.T. Goodrich Randomized fully-scalable BSP techniques for multi-searching and convex hull construction Proc. of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms pp.767-776 1997.
39. L. Guibas D Salesin and J. Stolfi Constructing strongly convex approximate hulls with inaccurate primitives Algorithmica vol.9 pp.534-560 1993.
40. N. Gupta and S. Sen Optimal output-sensitive algorithms for constructing planar hulls in parallel Comput. Geom. Theory Appl. vol.8 no.3 pp.151-166 1997.
41. R.L. Graham An efficient algorithm for determining the convex hull of a finite planar set Inform. Process. Lett. vol.1 pp.73-82 1972.
42. R.L. Graham and F. Yao Finding the convex hull of a simple polygon J. of Algorithms vol.4 pp.324-331 1983
43. T. Hayashi K. Nakano and S. Olariu An O((Ioglogn)2) time convex hull algorithm for sorted points on reconfigurable meshes IEEE Trans on Parallel and Distributed Systems vol.9 no.12 pp.1167-1179 1998.
44. J.A. Holey and O.H. Ibarra Iterative algorithms for the planar convex hull problem on mesh connected arrays Parallel Comput. vol.18 no.3 pp.281-296 1992.
45. J. Jang M. Nigam V.K. Prasanna and S. Sahni Constant time algorithms for computational geometry on the reconfigurable mesh IEEE Trans. Parallel and Distributed Systems vol.8 pp.1-12 1997.
46. C.S. Jeong and D.T. Lee Parallel convex hull algorithms in 2D and 3D on mesh-connected computers Parallel Processing for Computer Vision and Display pp.66-76 1989.
47. D.G. Kirkpatrick and R. Seidel The ultimate planar convex hull of algorithm? SIAM J. Comput. vol.15 pp.287-299 1986.
48. D.T. Lee On finding the convex hull of a simple polygon International Journal of Computer and Information Sciences vol.12 no.2 pp.87-98 1983.
49. D.T. Lee and R. Jou Efficient parallel geometric algorithms on a mesh of trees Proc. of the 33rd Annual Southeast Conference pp.213-218 1995.
50. Z. Li and V.J. Milenkovic Constructing strongly convex hulls using exact or rounded arithmetic Algorithmica vol.8 pp.345-364 1992.
51. J. Matousek Linear optimization queries J. Algorithms vol.14 pp.432-448 1993.
52. D. McCallum and D. Avis A linear algorithm for finding the convex hull of a simple polygon Information Processing Letters vol.9 no.5 pp.201-20G 1979.
53. R. Miller and Q.F. Stout Efficient parallel convex hull algorithms IEEE Trans. Comput. vol.C-37 no.12 pp.1605-1618 1988.
54. R. Miller and Q.F. Stout Mesh computer algorithms for computational geometry IEEE Trans. Comput. vol.C-38 no.3 pp.321-340 1989.
55. K. Nakano A bibliography of published papers on dynamically reconfigurable architectures Parallel Processing Letters vol.5 pp.111-124 1995.
56. K. Nakano Computing the convex hull of a sorted set of points on a reconfigurable mesh Parallel Algorithms and Applications vol.8 pp.243-250 1996.
57. F. Nielsen and M. Yvinec An output-sensitive convex hull algorithm for planar objects Comput. Gcom. Theory Appl. vol.8 no.l pp.39-65 1998.
58. S. Olariu J.L. Schwing and J. Zhang Time-optimal convex hull algorithms on enhanced meshes BIT vol.33 pp.396-410 1993.
59. S. Olariu J.L. Schwing and J. Zhang Fast component labeling and convex hull computation on reconfigurable meshes Image and Vision Computing Journal vol.11 pp.447-455 1993.
60. F.P. Preparata and S.J. Hong " Convex hulls of finite sets of points in two and three dimensions" Commun. ACM vol.20 pp.87-93 1977.
61. F.P. Preparata and M.L. Shamos Computational Geometry: An Introduction Springer-Verlag New York 1985.
62. D. Rappaport "A convex hull algorithm for discs and applications" Computational Geometry: Theory and Applications vol.2 pp.171-187 1992.
63. J.H. Reif and S. Sen "Optimal parallel randomized algorithms for three-dimensional convex hulls and related problems" SIAAJ J. Comput. vol.21 no.3 pp.466-485 1992.
64. A. Schäffer and C. Van Wyk "Convex hulls of piecewiseSmooth Jordan curves" J. Algorithms vol.8 no.l pp.6694 1987.
65. 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.
66. R. Seidel "Constructing higher-dimensional convex hulls at logarithmic cost per face" Proc. 18th. Annu. ACM Sympos. Theory Comput. pp.404-413 1986.
67. R. Seidel "Small-dimensional linear programming and convex hulls made easy" Discrete Comput. Geom. vol.6 pp.423-434 1991.
68. S. Shin and T. \Voo "Finding the convex hull of simple polygon in linear time" Pattern Recognition vol.19 no.6 pp.453-458 1986.
69. I. Stojmenovic "Computational geometry on a hypercube" Proc. .of 1988 International Conference on Parallel Processing vol.3 pp. 100-103 1988.
70. H. YVagcner "Optimal parallel hull construction for simple
71. polygons in O(loglogn) time" Proc. 33rd Annual Symposium on Foundations of Computer Science pp.593-599 1992.
72. J. Zhou X. Deng and P. Dymond "A 2-D parallel convex hull algorithm with optimal communication phases" Proc. of llth International Parallel Processing Symposium PP.59G-G02 1997.