Efficient BSR-based parallel algorithms for geometrical problems

This paper presents BSR-parallel algorithms for three geometrical problems: point location, convex hull and smallest enclosing rectangle. These problems are solved in constant time using the BSR model introduced by Akl and Guenther in 1989. The first algorithm uses O(N) processors (N is the number of edges of the polygon R). The second uses O(N'/sup 2/) processors (N' is the number of points) and the third one uses O(N'/sup 2/) processors (it need the convex hull) to solve the smallest enclosing rectangle problem. These new results suggest that many other geometrical problems can be solved in constant time using the BSR model.