Optimal BSR Solutions to Several Convex Polygon Problems

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.

[1]  Wojciech Rytter,et al.  Efficient parallel algorithms , 1988 .

[2]  Selim G. Akl.  Parallel computation: models and methods , 1997 .

[3]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

[4]  Ivan Stojmenovic,et al.  Computing External Watchman Routes on Pram, BSR, and Interconnection Network Models of Parallel Computation , 1994, Parallel Process. Lett..

[5]  Ivan Stojmenovic,et al.  Constant Time BSR Solutions to Parenthesis Matching, Tree Decoding, and Tree Reconstruction From Its Traversals , 1996, IEEE Trans. Parallel Distributed Syst..

[6]  Jean Frédéric Myoupo,et al.  A Constant Time Parallel Detection of Repetitions , 1999, Parallel Process. Lett..

[7]  Jean Frédéric Myoupo,et al.  EFFICIENT PARALLEL ALGORITHMS FOR THE LIS AND LCS PROBLEMS ON BSR MODEL USING CONSTANT NUMBER OF SELECTIONS , 2000, Parallel Algorithms Appl..

[8]  Ivan Stojmenovic,et al.  Multiple criteria BSR: an implementation and applications to computational geometry problems , 1994, 1994 Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences.

[9]  Selim G. Akl,et al.  Parallel computational geometry , 1992 .

[10]  Jean Frédéric Myoupo,et al.  Efficient BSR-based parallel algorithms for geometrical problems , 2001, Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing.

[11]  Selim G. Akl,et al.  An Optimal Implementation of Broadcasting with Selective Reduction , 1993, IEEE Trans. Parallel Distributed Syst..

[12]  Selim G. Akl,et al.  Broadcasting with Selective Reduction , 1989, IFIP Congress.

[13]  Jean Frédéric Myoupo,et al.  Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems , 1999, J. Parallel Distributed Comput..

[14]  David Semé.  An Efficient Algorithm on the BSR-Based Parallel Architecture for the k-LCS Problem , 1999, PDPTA.

[15]  Ivan Stojmenovic,et al.  Data communication and computational geometry on the star and pancake interconnection networks , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.