Finding the convex hull of discs in parallel

International Journal of Computational Geometry and Applications

Volumn 8, Issue 3, 1998, Pages 305-319

  Chen, Wei ^a   Wada, Koichi ^a   Kawaguchi, Kimio ^a   Chen, Danny Z ^b  

^a NAGOYA INSTITUTE OF TECHNOLOGY   (Japan)

^b University of Notre Dame   (United States)

Author keywords

Computational geometry; Convex hulls; EREW PRAM; Parallel algorithms

Indexed keywords

EID: 0010316615     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195998000151     Document Type: Article

References (27)

1. A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaing and C. Yap, "Parallel computational geometry," Algorithmica, 3 (1988) 293-327.
2. N. M. Amato, M. T. Goodrich and E. A. Ramos, "Parallel algorithms for higher-dimensional convex hulls," In Proc. of the 36th Annual Symposium on Foundations of Computer Science, 1995, pp. 683-694.
3. N. M. Amato and F. P. Preparata, "A time-optimal parallel algorithm for three-dimensional convex hulls," Algorithmica, 14 (1995) 168-182.
4. M. J. Atallah and M. T. Goodrich, "Efficient parallel solutions to some geometric problems," Journal of Parallel and Distributed Computing, 3 (1986) 492-507.
5. M. J. Atallah and M. T. Goodrich, "Parallel algorithms for some functions of two convex polygons," Algorithmica, 3 (1988) 535-548.
6. G. Bilardi and A. Nicolau, "Adaptive bitonic sorting: An optimal parallel algorithm for shared-memory machines," SIAM J. Computing, 18 (1989) 216-228.
7. J. D. Boissonnat, A. Cérézo, O. Devillers, J. Duquesne and M. Yvinec, "An algorithm for constructing the convex hull of a set of spheres in dimension d," In Proc. of the 4th Canadian Conference on Computational Geometry, 1992, pp. 269-273.
8. D. Z. Chen, "Efficient geometric algorithms on the EREW PRAM," IEEE Transactions on Parallel and Distributed Systems, 6 (1995) 41-47.
9. D. Z. Chen, "Efficient parallel binary search on sorted arrays, with applications," IEEE Transactions on Parallel and Distributed Systems, 6, (1995) 440-445.
10. D. Z. Chen, W. Chen, K. Wada and K. Kawaguchi, "Parallel algorithms for partitioning sorted sets and related problems," Technical Report of Kawaguchi Lab., Dept. of Electrical and Computer Engineering, Nagoya Institute of Technology, TR96-01, Jan. 1996. To appear in the Fourth Annual European Symposium on Algorithms, 1996.
11. W. Chen, K. Nakano, T. Masuzawa and N. Tokura, "Optimal parallel algorithms for finding the convex hull of a sorted point set," IEIGE Trans., J74-D-I (12) (1991), 814-825 (in Japanese).
12. W. Chen, K. Nakano, T. Masuzawa and N. Tokura, "Optimal parallel algorithm for computing the prefix convex hulls of a sorted points set," IEICE Trans. Fundamentals, E77-A (10) (1994), 1675-1683.
13. W. Chen, K. Wada and K. Kawaguchi, "A parallel method for finding the convex hull of discs," IEEE First International Conference on Algorithm and Architectures for Parallel Processing, 1995, pp. 274-281.
14. W. Chen, K. Wada and K. Kawaguchi, "Parallel convex hull algorithms in a curved world," The Fourth International Conference for Young Computer Scientists, Beijing, China, 1995, pp. 100-105
15. R. Cole and M. T. Goodrich, "Optimal parallel algorithms for point-set polygon problems," Algorithmica, 7 (1992) 3-23.
16. O. Devillers and M. J. Golin, "Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas," In Proc. of the 6th Canadian Conference on Computational Geometry, 1994, pp.153-158.
17. P.-O. Fjällström, J. Katajainen, C. Levcopoulos and O. Petersson, "A sublogarithmic convex hull algorithm," Bit, 30 (1990) 378-384.
18. A. Gibbons and W. Rytter, Efficient Parallel Algorithms (Cambridge University Press, 1988).
19. M. T. Goodrich, "Finding the convex hull of a sorted point set in parallel," Information Processing Letters, 26 (1987) 173-179.
20. M. T. Goodrich, "Geometric partitioning made easy, even in parallel," In Proc. of the 9th Annual ACM Symp. on Computational Geometry, 1993, pp.73-82.
21. T. Hagerup and C. Rub, "Optimal merging and sorting on the EREW PRAM," Information Processing Letters, 33 (1989), 181-185.
22. F. P. Preparata and M. L. Shamos, Computational Geometry: An Introduction (Springer-Verlag, 1985).
23. D. Rappaport, "A convex hull algorithm for discs, and applications," Computational Geometry: Theory and Applications, 2 (1992) 171-187.
24. M. Sharir and P. K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications (Cambridge University Press, 1995).
25. K. V. Weringh, "Algorithms for the Voronoi diagram of a set of disks," M.Sc. thesis, Department of Computing and Information Science, Queen's University, Kingston, Ontario, 1990.
26. A. C. Yao, "A lower bound to finding convex hulls," J. of the ACM, 28 (1981), 780-787.
27. M. Yoshimori, W. Chen and N. Tokura, "An efficient convex hull parallel algorithm for discs," IEICE Trans., J78-D-I (5) (1995) 500-503.