Podality-Based Time-Optimal Computations on Enhanced Meshes

The main contribution of this paper is to present simple and elegant podality-based algorithms for a variety of computational tasks motivated by, and finding applications to, pattern recognition, computer graphics, computational morphology, image processing, robotics, computer vision, and VLSI design. The problems that we address involve computing the convex hull, the diameter, the width, and the smallest area enclosing rectangle of a set of points in the plane, as well as the problems of finding the maximum Euclidian distance between two planar sets of points, and of constructing the Minkowski sum of two convex polygons. Specifically, we show that once we fix a positive constant ffl, all instances of size m, (n 1 2 +ffl m n) of the problems above, stored in the first d m p n e columns of a mesh with multiple broadcasting of size p n \Theta p n can be solved time-optimally in \Theta( m p n ) time