Fast Euclidean Distance Transformation by Propagation Using Multiple Neighborhoods
- 1 November 1999
- journal article
- research article
- Published by Elsevier in Computer Vision and Image Understanding
- Vol. 76 (2) , 163-172
- https://doi.org/10.1006/cviu.1999.0783
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Distance transformations in digital imagesPublished by Elsevier ,2006
- Exact Euclidean distance function by chain propagationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast raster scan distance propagation on the discrete rectangular latticeCVGIP: Image Understanding, 1992
- Voronoi diagrams—a survey of a fundamental geometric data structureACM Computing Surveys, 1991
- An efficient uniform cost algorithm applied to distance transformsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Hierarchical chamfer matching: a parametric edge matching algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Computing distance transformations in convex and non-convex domainsPattern Recognition, 1987
- Distance transformations in arbitrary dimensionsComputer Vision, Graphics, and Image Processing, 1984
- Euclidean distance mappingComputer Graphics and Image Processing, 1980
- Distance functions on digital picturesPattern Recognition, 1968