Sciweavers

TJS
2002

Optimal BSR Solutions to Several Convex Polygon Problems

13 years 6 months ago
Optimal BSR Solutions to Several Convex Polygon Problems
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.
Jean Frédéric Myoupo, David Sem&eacu
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 2002
Where TJS
Authors Jean Frédéric Myoupo, David Semé, Ivan Stojmenovic
Comments (0)