Computational geometry: an introduction
Computational geometry: an introduction
Array processor with multiple broadcasting
Journal of Parallel and Distributed Computing
Efficient Parallel Convex Hull Algorithms
IEEE Transactions on Computers
Image Computations on Meshes with Multiple Broadcast
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Computers
Square Meshes are Not Always Optimal
IEEE Transactions on Computers
Journal of Parallel and Distributed Computing
A time-optimal multiple search algorithm on enhanced meshes, with applications
Journal of Parallel and Distributed Computing
Time-optimal nearest-neighbor computations on enhanced meshes
Journal of Parallel and Distributed Computing
Computating the width of a set
SCG '85 Proceedings of the first annual symposium on Computational geometry
Determining the minimum-area encasing rectangle for an arbitrary closed curve
Communications of the ACM
The Massively Parallel Processor
The Massively Parallel Processor
Computer Vision
Designing Efficient Parallel Algorithms on Mech-Connected Computers with Multiple Broadcasting
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Fast Selection Algorithm for Meshes with Multiple Broadcasting
IEEE Transactions on Parallel and Distributed Systems
Time-Optimal Visibility-Related Algorithms on Meshes with Multiple Broadcasting
IEEE Transactions on Parallel and Distributed Systems
Square Meshes Are Not Optimal for Convex Hull Computation
IEEE Transactions on Parallel and Distributed Systems
Time- and VLSI-optimal convex hull computation on meshes with multiple broadcasting
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
Image Analysis and Mathematical Morphology
Image Analysis and Mathematical Morphology
Time- and VLSI-Optimal Sorting on Enhanced Meshes
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
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 $\epsilon,$ all instances of size m, $\left( {n^{{\textstyle{1 \over 2}}+\epsilon}\le m\le n} \right)$ of the problems above, stored in the first $\left\lceil {{\textstyle{m \over {\sqrt n}}}} \right\rceil $ columns of a mesh with multiple broadcasting of size $\sqrt n\times \sqrt n$ can be solved time-optimally in $\Theta \left( {{\textstyle{m \over {\sqrt n}}}} \right)$ time.