Abstract
A sequential algorithm is presented for computing the Euclidean distance transform of a k-dimensional binary image in time linear in the total number of voxels. The algorithm may be of practical value since it is relatively simple and easy to implement and it is relatively fast (not only does it run in linear time but the time constant is small).
Cite
CITATION STYLE
Maurer, C. R., Raghavan, V., & Qi, R. (2001). A linear time algorithm for computing the euclidean distance transform in arbitrary dimensions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2082, pp. 358–364). Springer Verlag. https://doi.org/10.1007/3-540-45729-1_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
