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).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H Breu, J Gil, D Kirkpatrick, M Werman. Linear time Euclidean distance transform algorithms. IEEE Trans. Pattern Anal. Mach. Intell., 17: 529–533, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maurer, C.R., Raghavan, V., Qi, R. (2001). A Linear Time Algorithm for Computing the Euclidean Distance Transform in Arbitrary Dimensions. In: Insana, M.F., Leahy, R.M. (eds) Information Processing in Medical Imaging. IPMI 2001. Lecture Notes in Computer Science, vol 2082. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45729-1_35
Download citation
DOI: https://doi.org/10.1007/3-540-45729-1_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42245-7
Online ISBN: 978-3-540-45729-9
eBook Packages: Springer Book Archive