Book Chapter10.1007/3-540-45729-1_35
A Linear Time Algorithm for Computing the Euclidean Distance Transform in Arbitrary Dimensions
Calvin R. Maurer,Vijay V. Raghavan,Rensheng Qi +2 more
- 18 Jun 2001
- pp 358-364
21
TL;DR: 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.
read more
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).
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
2D Euclidean distance transform algorithms: A comparative survey
TL;DR: In this paper, state-of-the-art sequential 2D EDT algorithms are reviewed and compared, in an effort to reach more solid conclusions regarding their differences in speed and their exactness.
502
2 2D Euclidean Distance Transform Algorithms: A Comparative Survey
Ricardo Fabbri,Luciano da Fontoura Costa,Julio Cesar Torelli,Odemir Martinez Bruno +3 more
- 01 Jan 2008
TL;DR: In this work, state-of-the-art sequential 2D EDT algorithms are reviewed and compared, in an effort to reach more solid conclusions regarding their differences in speed and their exactness.
487
Hand Recognition Using Geometric Classifiers
TL;DR: A novel minimum enclosing ball classifier is described which performs well for hand recognition and could be of interest for other applications.
108
Fast surface approximation for volume and surface area measurements using distance transform
TL;DR: A novel computer vision technique combining laser triangulation and a distance transform isveloped to improve the 3-D measurement accuracy for objects with irregular shapes and the measurement accuracy is compared with the accuracy using other surface interpolation techniques for the volume measurement of moving objects.
28
Euclidean Skeletons of 3D Data Sets in Linear Time by the Integer Medial Axis Transform
Wim H. Hesselink,Menno Visser,Jos B. T. M. Roerdink +2 more
- 01 Jan 2005
TL;DR: A general algorithm for computing Euclidean skeletons of 3D data sets in linear time, defined in terms of a new concept, called the integer medial axis (IMA) transform, which has a time complexity which is linear in the amount of voxels, and can be easily parallelized.
References
Linear time Euclidean distance transform algorithms
TL;DR: Two linear time algorithms for computing the Euclidean distance transform of a two-dimensional binary image are presented based on the construction and regular sampling of the Voronoi diagram whose sites consist of the unit pixels in the image.