Implementations of a Parallel Algorithm for Computing Euclidean Distance Map in Multicore Processors and GPUs
- 1 January 2011
- journal article
- Published by IJNC Editorial Committee in International Journal of Networking and Computing
- Vol. 1 (2), 260-276
- https://doi.org/10.15803/ijnc.1.2_260
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Efficient Parallel Algorithms for Euclidean Distance TransformThe Computer Journal, 2004
- Optimal parallel algorithms for finding proximate points, with applicationsIEEE Transactions on Parallel and Distributed Systems, 1998
- Parallel Computing Using Optical InterconnectionsPublished by Springer Science and Business Media LLC ,1998
- A unified linear-time algorithm for computing distance mapsInformation Processing Letters, 1996
- Parallel computation of exact Euclidean distance transformParallel Computing, 1996
- An optimal parallel algorithm for the Euclidean distance maps of 2-D binary imagesInformation Processing Letters, 1995
- EFFICIENT ALGORITHMS FOR THE EUCLIDEAN DISTANCE TRANSFORMParallel Processing Letters, 1995
- Linear time Euclidean distance transform algorithmsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1995
- A fast algorithm for Euclidean distance maps of a 2-D binary imageInformation Processing Letters, 1994