Linear Time Euclidean Distance Transform Algorithms

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 17, Issue 5, 1995, Pages 529-533

  Breu, Heinz ^a   Kirkpatrick, David ^a   Gil, Joseph ^b   Werman, Michael ^c  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

algorithm; Distance transform; Euclidean distance; Voronoi diagram

Indexed keywords

CALCULATIONS; FUNCTIONS; IMAGE ANALYSIS; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION;

BINARY IMAGE; DISTANCE TRANSFORM; EUCLIDEAN DISTANCE; PIXEL; TWO DIMENSIONAL; VORONOI DIAGRAM;

ALGORITHMS;

EID: 0029304709     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.391389     Document Type: Article

References (22)

1. N. Ahuja, “Dot pattern processing using Voronoi polygons as neighborhoods,” Proc. Fifth Int'l Conf. Pattern Recogition, pp. 1122-1127, Miami Beach, 1980.
2. C. Arcelli and G. Sanniti de Baja, “Computing Voronoi diagrams in digital pictures,” Pattern Recognition Letters, pp. 383-389, 1986.
3. G. Borgefors, “Distance transformations in arbitrary dimensions,” Computer Vision, Graphics, and Image Processing, vol. 27, pp. 321-345, 1984.
4. G. Borgefors, “Distance transformations in digital images,” Computer Vision, Graphics, and Image Processing, vol. 34, pp. 344-371, 1986.
5. G. Borgefors, “A new distance transformation approximating the Euclidean distance,” Proc. Int'l Joint Conf. Pattern Recognition, pp. 336-338, 1986.
6. K.L. Clarkson, “Approximation algorithms for shortest path motion planning.” Proc. 19th Ann. ACM Symp. Theory Computers, pp. 56-65, 1987.
7. P.E. Danielsson, “Euclidian distance mapping,” Computer Graphics and Image Processor, vol. 14, pp. 227-248, 1980.
8. P.P. Das and P.P. Chakrabarti, “Distance functions in digital geometry,” Information Sciences, vol. 42, pp. 113-136, 1987.
9. G.L. Dirichlet, “Über die Reduktion der positiven quadratischen Formen mit drei unbestimmten ganzen Zahlen,” J. Reine Angew. Math., vol. 40, pp. 209-227, 1850.
10. J. Fairfield, “Segmenting dot patterns by Voronoi diagram concavity,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 32, pp. 104-110, 1983.
11. F. Klein and O. Kübler, “Euclidean distance transformation and model-guided image interpretation,” Pattern Recognition Letters, vol. 5, pp. 19-29, 1987.
12. M.N. Kolountzakis and K.N. Kurulakos, “Fast computationion of the Euclidean distance map for binary images,” Information Processing Letters, vol. 43, pp. 181-184, 1992.
13. D.W. Pagliero, “Distance transforms,” Computer Vision, Graphics, and Image Processing: Graphical models and Image Processing, vol. 54, pp. 56-74, 1992.
14. D.W. Paglieroni, “A unified distance transform algorithm and architecture,” Machine Vision and Applications, vol. 5, pp. 47-55, 1992.
15. F.P. Preparata and M. I. Shamos, Computational Geometry: An Introduction. New York: Springer-Verlage, 1985.
16. I. Ragnemalm, “Neighborhoods for distance transformations using ordered propagation,” Computer Vision, Graphics, and Image Processing: Image Understanding, vol. 56, pp. 399-409, 1992.
17. A. Rosenfeld and A.C. Kak, Digital Picture Processing. New York: Academic Press, 2nd ed., 1978.
18. A. Rosenfeld and J. Pfaltz, “Sequential operations in digital picture processing.” J. ACM, vol. 13, pp. 471-494, 1966.
19. A. Rosenfeld and J. Pfaltz, “Distance functions on digital pictures,” Pattern Recognition, vol. 1, pp. 33-61, 1968.
20. M.G. Voronoi, “Nouvelles applications des parametres continus á la theorie des formes quadratiques,” J. Reine Angew. Math., vol. 134, pp. 198-287, 1908.
21. H. Yamada, “Complete Euclidean distance transformation by parallel operation.” Proc. Seventh Int'l Conf. Pattern Recognition, pp. 69-71, Montreal, 1984.
22. M. Yamashita and T. Ibaraki, “Distances defined by neighborhood sequences,” Pattern Recognition, vol. 19, pp. 237-246, 1986.