Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
Distance transforms: properties and machine vision applications
CVGIP: Graphical Models and Image Processing
A unified distance transform algorithm and architecture
Machine Vision and Applications
A fast algorithm for Euclidean distance maps of a 2-D binary image
Information Processing Letters
A unified linear-time algorithm for computing distance maps
Information Processing Letters
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Linear Time Euclidean Distance Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Chessboard Distance Transform and the Medial Axis Transform are Interchangeable
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Fast parallel chessboard distance transform algorithms
ICPADS '96 Proceedings of the 1996 International Conference on Parallel and Distributed Systems
Parallel Computation of the Euclidean Distance Transform on a Three-Dimensional Image Array
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
This paper presents a parallel algorithm for the weighted distance transform and the nearest feature transform of an n * n binary image. We show that the algorithm runs in O(log n) time using n^2 / log n processors on the EREW PRAM and in O(log log n) time using n^2 / log log n processors on the common CRCW PRAM. We also show that the algorithm runs in O(n^2/p^2 + n) time on a p \times p mesh and in O(n^2/p^2 + (n log p) / p) time on a p^2 processor hypercube (for 1