Computational geometry on the broadcast communication model

Journal of Information Science and Engineering

Volumn 15, Issue 3, 1999, Pages 383-395

  Yang, Chang Biau ^a  

^a NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; MATHEMATICAL MODELS; PARALLEL ALGORITHMS;

BROADCAST COMMUNICATION MODELS;

INFORMATION SCIENCE;

EID: 0032624710     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaing and C. Yap, "Parallel computational geometry," Algorithmica, Vol. 3, No. 3, 1988, pp. 293-327.
2. S. G. Akl and G. T. Toussaint, "A fast convex hull algorithm," Information Processing Letters, Vol. 7, No. 5, 1978, pp. 219-222.
3. M. J. Atallah, R. Cole and M. T. Goodrich, "Cascading divide-and-conquer: a technique for designing parallel algorithms," SIAM Journal on Computing, Vol. 18, No. 3, 1989, pp. 499-532.
4. M. J. Atallah and M. T. Goodrich, "Efficient parallel solutions to some geometric problems," Journal of Parallel and Distributed Computing, Vol. 3, No. 4, 1986, pp 492-507.
5. J. L. Bentley, "Multidimensional divide-and-conquer," Communications of the ACM, Vol. 23, No. 4, 1980, pp. 214-229
6. R. Dechter and L. Kleinrock, "Broadcast communications and distributed algorithms, " IEEE Transactions on Computers, Vol. C-35, No. 3, 1986, pp. 210-219.
7. C. R. Dyer, "A fast parallel algorithm for the closest pair problem," Information Processing Letters, Vol. 11, No. 1, 1980, pp. 49-52.
8. P. O. Fjallstrom, J. Katajainen, C. Levcopoulos and O. Petersson, "A sublogarithmic convex hull algorithm," BIT, Vol. 30, No. 3, 1990, pp. 378-384.
9. M. T. Goodrich, "Finding the convex hull of a sorted point set in parallel," Information Processing Letters, Vol 26, No. 1, 1987, pp. 173-179.
10. R. Graham, "An efficient algorithm for determining the convex hull of a planar set," Information Processing Letters, Vol. 1, No. 4, 1972, pp. 132-133.
11. H. T. Kung, F. Luccio and F. P. Preparata, "On finding the maxima of a set of vectors, " Journal of the ACM, Vol. 22, No. 4, 1975, pp. 469-476.
12. J. M. Marberg and E. Gafni, "Sorting and selection in multi-channel broadcast networks" in Proceedings of 1985 International Conference on Parallel Processing, pp. 846-850.
13. F. P. Preparata and S. J. Hong, "Convex hulls of finite sets of points in two and three dimensions," Communications of the ACM, Vol. 20, No. 2, 1977, pp. 87-93.
14. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, 1985, Springer-Verlag, New York.
15. K. V. S. Ramarao, "Distributed sorting on local area networks," IEEE Transactions on Computers, Vol. C-37, No. 2, 1988, pp. 239-243.
16. S.-H. Shiau and C. B. Yang, "A fast maximum finding algorithm on broadcast communication," Information Processing Letters, Vol. 60, No. 2, 1996, pp.81-89.
17. C. Y. Tang and M. J. Chiu, "Distributed sorting on the serially connected local area networks," in Proceedings of 1989 International Conference on Networks, Singapore, 1989, pp. 458-462.
18. B. F. Wang and G. H. Chen, "Constant time algorithms for sorting and computing convex hulls," in Proceedings of International Computer Symposium, Hsinchu, Taiwan, 1990, pp. 607-612.
19. C. B. Yang, "Reducing conflict resolution time for solving graph problems in broadcast communications," Information Processing Letters, Vol. 40, No. 6, 1991, pp. 295-302.
20. C. B. Yang, R. C. T. Lee and W. T. Chen, "Parallel graph algorithms based upon broadcast communications," IEEE Transactions on Computers, Vol. C-39, No. 12, 1990, pp. 1468-1472.
21. C. B. Yang, R. C. T. Lee and W. T. Chen, "Conflict-free sorting algorithms under single-channel and multi-channel broadcast communication models," in Proceedings of International Conference on Computing and Information also in Lecture Notes in Computer Science, Vol. 497, Ottawa, Canada, 1991, pp. 350-359.