Parallel Computations on Reconfigurable Meshes
IEEE Transactions on Computers
An Optimal Sorting Algorithm on Reconfigurable Mesh
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
Geometric Data Structures on a Reconfigurable Mesh, with Applications
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
| Hi-index | 0.00 |
1 and r2, the Angle-Restricted All Nearest Neighborproblem (ARANN, for short) asks to compute for every point p in S the nearest point in S lying in the planar region bounded by two rays in the directions r1 and r2 emanating from p. The ARANN problem generalizes the well-known ANN problem and finds applications to pattern recognition, image processing, and computational morphology. Our main contribution is to present an algorithm that solves an arbitrary instance of size n of the ARANN problem in O(1) time on a reconfigurable mesh of size n x n. Our algorithm is optimal in the sense that O(n2) processors are necessary to solve the ARANN problem in O(1) time.