2-D parallel convex hull algorithm with optimal communication phases

Parallel Computing

Volumn 27, Issue 3, 2001, Pages 243-255

  Dymond, Patrick ^a   Zhou, Jieliang ^a   Deng, Xiaotie ^b  

^a YORK UNIVERSITY   (Canada)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; OPTIMIZATION; PARALLEL ALGORITHMS; RESPONSE TIME (COMPUTER SYSTEMS);

CONVEX HULL ALGORITHMS; PARALLEL SORTING ALGORITHMS;

PARALLEL PROCESSING SYSTEMS;

EID: 0035246825     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(00)00097-1     Document Type: Article

References (35)

1. A. Ferreira, A.Rau-Chaplin, S. Ueda, Scalable 2-D convex hull and triangulation algorithm for coarse grained multicomputers, in: Seventh IEEE Symposium on Parallel and Distributed Processing, 1995, pp. 561-568.
2. D.G. Kirkpatrick, R. Seidel, The ultimate planar hull algorithm, SIAM Journal of Computation 15 (1) (1986).
3. F.P. Preparata, M.I. Shamos, Computational Geometry: An Introduction, Springer, New York, 1985.
4. Aggarwal A., Chazelle B., Guibas L., Ó'Dúnlaing C., Yap C. Parallel computational geometry. Algorithmica. 3:1988;293-327.
5. A. Aggarwal, A.K. Chandra, M. Snir, On communication latency in PRAM computations, in: Proc. SPAA89, 1989, pp. 11-21.
6. N.M. Amato, M. Goodrich, E. Ramos, Parallel algorithms for high-dimensional convex hulls, in: Proceeedings of the 35th Annual IEEE Symposium on Foundations in Computer Science, 1994, pp. 683-694.
7. 1 parallel 3-D convex hull algorithm, in: Proceedings of the Nineth Annual ACM Symposium on Computational Geometry, 1993, pp. 289-297.
8. Atallah M.J., Goodrich M.T. Efficient parallel solutions to some geometric problems. Journal of Parallel and Distributed Computing. 3:1986;492-507.
9. Atallah M.J., Goodrich M.T. Parallel algorithms for some functions of two convex polygons. Algorithmica. 3:1988;535-548.
10. R.J. Anderson, L. Snyder, A comparison of shared and nonshared memory models of computation, Proceedings of IEEE 79 (4) 480-487.
11. G.E. Blelloch, C.E. Leiserson, B.M. Maggs, C.G. Plaxton, S.J. Smith, M. Zagha, A comparison of sorting algorithms for the connection machine CM-2, in: Proc. SPAA91, 1991, pp. 3-16.
12. K.E. Batcher, Sorting networks and their applications, in: Proceedings of AFIPS Spring Joint Computer Conference, 1968, pp. 307-314.
13. Brown K.Q. Voronoi diagrams from convex hulls. Information Processing Letters. 9:1979;223-228.
14. A. Chow, Parallel algorithms for geometric problems, Ph.D. Thesis, University of Illinois at Urbana-Champaign, 1980.
15. D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, T. von Eicken, LogP: towards a realistic model of parallel computation. Presented in the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 1993, pp. 235-261.
16. Clarkson K.L., Mehlhorn K., Seidel R. Four results on randomized incremental constructions. Computational Geometry Theory and Application. 3(4):1993;185-212.
17. F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. Khokhar, A 3-D convex hull algorithm for coarse-grained multicomputers, Theory of Computing Systems 30 (1997) 547-558; A special issue for selected papers presented at the Seventh ACM Symposium on Parallel Algorithms and Architectures, Santa Barbara, 1995.
18. F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. Khokhar, A 3-D convex hull algorithm for coarse-grained multicomputers, Theory of Computing Systems 30 (1997) 547-558; A special issue for selected papers presented at the Seventh ACM Symposium on Parallel Algorithms and Architectures, Santa Barbara, 1995.
19. F. Dehne, A. Fabri, C. Kenyon, Scalable and architecture independent parallel geometric algorithms with high probability optimal time, in: Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994, pp. 586-593.
20. F. Dehne, A. Fabri, A. Rau-Chaplin, Scalable parallel geometric algorithms for coarse grained multicomputers, in: Proceedings of ACM Nineth Annual Computational Geometry, 1993, pp. 298-307.
21. X. Deng, N. Gu, Good programming style on multiprocessors, in: Proceedings of IEEE Symposium on Parallel and Distributed Processing, Dallas, October 1994, pp. 538-543.
22. X. Deng, A Convex hull algorithm for coarse grained multiprocessors, in: Proceedings of the Fifth International Symposium on Algorithms and Computation, 1994.
23. X. Deng, P. Dymond, Efficient Routing and Message Bounds for Optimal Parallel Algorithms, IPPS95, Santa Barbara, California, 1995, pp. 556-562.
24. X. Deng, B. Zhu, Randomized algorithm for voronoi diagram of line segments on coarse grained multiprocessors (a special issue on coarse grained parallel algorithms), Algorithmica 24 (3/4) (1999) 270-286.
25. A.V. Gerbessiotis, C.J. Siniolakis, Deterministic sorting and randomized median finding on the BSP model, in: SPAA96, 1996, pp. 223-232.
26. A.V. Gerbessiotis, L.G. Valiant, Direct bulk-synchronous parallel algorithms, in: Proceedings of the Third Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, vol. 621, Springer, New York, 1992, pp. 1-18.
27. M.T. Goodrich, Communication-efficient parallel sorting, in: STOC95, pp. 247-255.
28. M. Goudreau, K. Lang, S. Rao, T. Suel, T. Tsantilas, Towards efficiency and portability, in: SPAA96, 1996, pp. 1-12.
29. D.R. Helman, J. Ja'Ja', D.A. Bader, A new deterministic parallel sorting algorithm with an experimental evaluation, Tech. Rep. CS-TR-3670 and UMIACS-TR-96-54. Institute for Advanced Computer Studies (UMIACS) and the Department of Electrical Engineering, University of Maryland, College Park, August 1996.
30. H. Li, K.C. Sevcik, Parallel sorting by overpartitioning, in: SPAA, 1994, pp. 46-56.
31. Reif J.H., Sen S. Optimal parallel algorithms for 3-D convex hulls and related problems. SIAM Journal of Computing. 21:1992;446-485. with corrigendum in.
32. Reif J.H. S. Sen, Optimal parallel algorithms for 3-D convex hulls and related problems. SIAM Journal of Computing. 23:1994;447-448.
33. Snyder L. Type architectures, shared memory and the corollary of modest potential. Annual Review of Computer Science. 1:1986;289-317.
34. Valiant L.G. A bridging model for parallel computation. Communications of the ACM. 33:1990;103-111.
35. L.G. Valiant, General purpose parallel architectures, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, The MIT Press/Elsevier, Cambridge, MA, 1990, pp. 943-972.