Abstract
This paper focuses on BSR (Broadcasting with Selective Reduction) implementation of algorithms solving basic convex polygon problems. More precisely, constant time solutions on a linear number, max(N, M) (where N and M are the number of edges of the two considered polygons), of processors for computing the maximum distance between two convex polygons, finding critical support lines of two convex polygons, computing the diameter, the width of a convex polygon and the vector sum of two convex polygons are described. These solutions are based on the merging slopes technique using one criterion BSR operations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. G. Akl. The Design and Analysis of Parallel Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1989.
S. G. Akl. Parallel Computation: Models and Methods. Prentice Hall, Englewood Cliffs, NJ, 1997.
S. G. Akl and L. Fava Lindon. An optimal implementation of broadcasting with selective reduction. IEEE Transactions on Parallel and Distributed Systems, 4:256–269, 1993.
S. G. Akl and G. R. Guenther. Broadcasting with selective reduction. In G. X. Ritter, ed., Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, pp. 515–520, San Francisco, North-Holland, Amsterdam, 1989.
S. G. Akl and K. A. Lyons. Parallel Computational Geometry. Prentice Hall, Englewood Cliffs, NJ, 1993.
S. G. Akl, K. Qiu, and I. Stojmenovic. Data communication and computational geometry on the star and pancake interconnection networks. In Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing, pp. 414–422, 1991.
S. G. Akl and I. Stojmenovic. Multiple criteria BSR: an implementation and applications to computational geometry problems. In Proceedings of the Twenty-Seventh Annual Hawaii International Conference on System Sciences, pp. 159–168, 1994.
E. Delacourt, J. F. Myoupo, and D. Semé. A constant time parallel detection of repetition. Parallel Processing Letters, 9:81–92, 1999.
L. P. Gewali and I. Stojmenovic. Computing extremal watchman routes on PRAM, BSR, and interconnection network models of parallel computation. Parallel Processing Letters, 4:83–93, 1994.
A. Gibbons and W. Rytter. Efficient Parallel Algorithms, Cambridge University Press, Cambridge, England, 1988.
J. F. Myoupo and D. Semé. A parallel solution of the sequence alignment problem using BSR model. In Proceedings of the 10th International Conference of Parallel and Distributed Computing Systems, pp. 357–362, 1997.
J. F. Myoupo and D. Semé. Time-efficient parallel algorithms for the longest common subsequence and related problems. Journal of Parallel and Distributed Computing, 57:212–223, 1999.
J. F. Myoupo and D. Semù. Efficient parallel algorithms for the LIS and LCS problems on BSR model using constant number of selections. Parallel Algorithms and Applications, 14:187–202, 2000.
J.-F. Myoupo and D. Semé. Efficient BSR-based parallel algorithms for geometrical problems. 9th Euromicro Workshop on Parallel and Distributed Processing, 2001.
D. Semé. An efficient algorithm on the BSR-based parallel architecture for the k-LCS problem. In Proceedings of International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'99, 1999.
I. Stojmenovic. Parallel Computational Geometry, Washington State University, Pullman, CS-87–176, 1987.
I. Stojmenovic. Computational geometry on hypercube. Proceedings of the International Conference on Parallel Processing, III:100–103, 1988.
I. Stojmenovic. Constant time BSR solutions to parenthesis matching, tree decoding, and tree reconstitution from its traversals. IEEE Transactions on Parallel and Distributed Systems, 7:218–224, 1996.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Myoupo, JF., Semé, D. & Stojmenovic, I. Optimal BSR Solutions to Several Convex Polygon Problems. The Journal of Supercomputing 21, 77–90 (2002). https://doi.org/10.1023/A:1013587415197
Issue Date:
DOI: https://doi.org/10.1023/A:1013587415197