Scalable 2D Convex Hull and Triangulation Algorithms for Coarse Grained Multicomputers

Journal of Parallel and Distributed Computing

Volumn 56, Issue 1, 1999, Pages 47-70

  Diallo, Mohamadou ^a   Ferreira, Afonso ^b   Rau Chaplin, Andrew ^c   Ubéda, Stéphane ^d  

^a UNIVERSITÉ BLAISE PASCAL   (France)

^b CNRS   (France)

^c DALHOUSIE UNIVERSITY   (Canada)

^d UNIV LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002834447     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1998.1503     Document Type: Article

References (37)

1. Akl S. G. A constant-time parallel algorithm for computing convex hulls. BIT. 22:1982;130-134.
2. Akl S. G., Lyons K. A. Parallel Computational Geometry. 1993;Prentice-Hall, New York.
3. E. Anderson, J. Brooks, C. Grassl, S. Scott, Performance of the CRAY T3E Multiprocessor, Proc. Supercomputing 97, 1997.
4. M. J. Atallah, J.-J. Tsay, On the parallel-decomposability of geometric problems, Proc. 5th Annu. ACM Sympos. Comput. Geom, 1989, 104, 113.
5. K. E. Batcher, Sorting networks and their applications, Proc. AFIPS Spring Joint Computer Conference, 1968, 307, 314.
6. Bentley J. L., Clarkson K. L., Levine D. B. Fast linear expected-time algorithms for computing maxima and convex hulls. Algorithmica. 9:1993;168-183.
7. Bertsekas D. P., Tsitsiklis J. N. Parallel and Distributed Computation: Numerical Methods. 1989;Prentice-Hall, Englewood Cliffs.
8. Chazelle B. Computational geometry on systolic chip. IEEE Trans. Comput. 33:1984;774-785.
9. A. L. Chow, Parallel algorithm for determining convex hull of sets of points in two dimension, Proc. of the Nineteenth Annual Allerton Conf. on Communication, Control and Computing, 1981, 214, 223.
10. D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos, R. Subrarnonian, T. von Eicken, LogP: Towards a realistic model of parallel computation, Fifth ACM SIGPLAN Symposium on the Principles and Practice of Parallel Programming, 1993, 1, 12.
11. 3, Proc. of the 6th IEEE Symposium on Parallel and Distributed Processing, October, Dallas, 1994.
12. Cypher R., Plaxton C. G. Deterministic sorting in nearly logarithmic time on the hypercube and related computers. ACM Symposium on Theory of Computing. 1990;Assoc. Comput. Math. New York. p. 193-203.
13. F. Dehne, X. Deng, P. Dymond, A. Fabri, A. Khokhar, A randomized parallel 3D convex hull algorithm for coarse grained multicomputers, Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, 1995, 27, 33.
14. F. Dehne, A. Fabri, C. Kenyon, Scalable and architecture independent parallel geometric algorithms with high probability optimal time, Proceedings for the 6th IEEE SPDP, IEEE Press, New York, 1994, 586, 593.
15. F. Dehne, A. Fabri, A. Rau-Chaplin, Scalable parallel geometric algorithms for coarse grained multicomputers, ACM Symposium on Computational Geometry, 1993.
16. X. Deng, N. Gu, Good algorithm design style for multiprocessors, Proc. of the 6th IEEE Symposium on Parallel and Distributed Processing, October, Dallas, 1994.
17. Devroye L., Toussaint G. T. A note on linear expected time algorithms for finding convex hulls. Computing. 26:1981;361-366.
18. Edelsbrunner H. Algorithms in combinatorial geometry. EATCS Monographs on Theoretical Computer Science. 1987;Springer-Verlag, Berlin.
19. A. Ferreira, A. Rau-Chaplin, S. Ubéda, Scalable 2d convex hull and triangulation for coarse grained multicomputers, Proc. of the 6th IEEE Symposium on Parallel and Distributed Processing, San Antonio, 1995.
20. Gerbessiotis A. V., Valiant L. G. Direct bulk-synchronous parallel algorithms. J. Parallel Distrib. Comput. 22:1994;251-267.
21. M. T. Goodrich, Communication-efficient parallel sorting, Proc. of the 28th annual ACM Symposium on Theory of Computing (STOC), May 22-24, Philadelphia, 1996.
22. Goodrich M. T., Tsay J. J., Vengroff D. E., Vitter J. S. External-memory computational geometry. IEEE Symposium on Foundations Comput. Sci. 1993;714-723.
23. Grand Challenges: High Performance Computing and Communications.
24. Greenberg R. I., Leiserson C. E. Randomized routing on fat-trees. Adv. in Comput. Res. 5:1989;345-374.
25. H. Li, K. C. Sevick, Parallel sorting by overpartitioning, Proc. of the ACM Symposium on Parallel Algorithms and Architectures, 1994, 46, 56.
26. Leighton F. T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. 1992;Morgan Kaufmann, San Mateo.
27. P. D. MacKenzie, Q. S. Stout, Asymptotically efficient hypercube algorithms for computational geometrie, Proc. of the Third Symposium on the Frontiers of Massively Parallel Computation, 1980, 8, 11.
28. J. M. Marberg, E. Gafni, Sorting in constant number of row and column phases on a mesh, Proc. Allerton Conference on Communication, Control and Computing, 1986, 603, 612.
29. Merks E. An optimal parallel algorithm for triangulation of a set of points in the plane. Int. J. Parallel Progr. 15:1986;399-411.
30. R. Miller, Q. F. Sout, Computational geometry on a mesh-connected computer (Preliminary version), Proc. of the 1984 International Conference on Parallel Processing, 1984, 236, 271.
31. Miller R., Stout Q. Efficent parallel convex hull algorithm. IEEE Trans. Comput. 37:1988;1605-1618.
32. Nath D., Maheshwari S. N., Bhatt P. C. Parallel algorithm for the convex hull problem in two dimensions. Technical Report. 1980.
33. Preparata F. P., Shamos M. I. Computational Geometry: an Introduction. 1985;Springer-Verlag, New York.
34. Reif J. H., Valiant L. G. A logarithmic time sort for linear size networks. J. Assoc. Comput. Math. 34:1987;60-76.
35. Valiant L. G. A bridging model for parallel computation. Commun. Assoc. Comput. Mach. 38:1990;103-111.
36. Valiant L. G. General Purpose Parallel Architecture. 1990;van Leewen, North Holland.
37. Wang C., Tsin Y. AnOn. Inform. Process. Lett. 25:1987;55-60.