The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Linear time Euclidean distance transform algorithms
Abstract
Two linear time (and hence asymptotically optimal) algorithms for computing the Euclidean distance transform of a two-dimensional binary image are presented. The algorithms are based on the construction and regular sampling of the Voronoi diagram whose sites consist of the unit (feature) pixels in the image. The first algorithm, which is of primarily theoretical interest, constructs the complete Voronoi diagram. The second, more practical, algorithm constructs the Voronoi diagram where it intersects the horizontal lines passing through the image pixel centers. Extensions to higher dimensional images and to other distance functions are also discussed.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Computational geometry. an introduction
Preparata, F. P., & Shamos, M. I. (1985) · Cited by 2,488
Voronoi, G. (1908) · Journal für die reine und angewandte Mathematik (Crelles Journal) · doi:10.1515/crll.1908.134.198 · Cited by 2,248
Danielsson, P.-E. (1980) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(80)90054-4 · Cited by 1,998
Distance transformations in digital images
Borgefors, G. (1986) · Computer Vision, Graphics, and Image Processing · doi:10.1016/s0734-189x(86)80047-0 · Cited by 1,898
Sequential Operations in Digital Picture Processing
Rosenfeld, A., & Pfaltz, J. L. (1966) · Journal of the ACM · doi:10.1145/321356.321357 · Cited by 1,675
Distance functions on digital pictures
Rosenfeld, A., & Pfaltz, J. L. (1968) · Pattern Recognition · doi:10.1016/0031-3203(68)90013-7 · Cited by 837
Distance transformations in arbitrary dimensions
Borgefors, G. (1984) · Computer Vision, Graphics, and Image Processing · doi:10.1016/0734-189x(84)90035-5 · Cited by 779
Sequencing-by-hybridization revisited: the analog-spectrum proposal
Preparata, F. P. (2004) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2004.12 · Cited by 320
Distance transforms: Properties and machine vision applications
Paglieroni, D. W. (1992) · CVGIP: Graphical Models and Image Processing · doi:10.1016/1049-9652(92)90034-u · Cited by 170
Neighborhoods for distance transformations using ordered propagation
Ragnemalm, I. (1992) · CVGIP Image Understanding · doi:10.1016/1049-9660(92)90050-d · Cited by 77
Cited by
Maurer, C. R., Qi, R., & Raghavan, V. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1177156 · Cited by 911
Improved Automatic Detection and Segmentation of Cell Nuclei in Histopathology Images
Al-Kofahi, Y., Lassoued, W., Lee, W., & Roysam, B. (2010) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2009.2035102 · Cited by 681
Computational/in silico methods in drug target and lead prediction
Agamah, F. E., Mazandu, G. K., Hassan, R., Bope, C. D., Thomford, N. E., Ghansah, A., & Chimusa, E. R. (2020) · Briefings in Bioinformatics · doi:10.1093/bib/bbz103 · Cited by 328
Automated generation of control skeletons for use in animation
Wade, L., & Parent, R. E. (2002) · The Visual Computer · doi:10.1007/s003710100139 · Cited by 96
Object Tracking in Structured Environments for Video Surveillance Applications
Zhu, J., Lao, Y., & Zheng, Y. F. (2010) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2009.2031395 · Cited by 93
Metadata
- Authors
- Breu, H., Gil, J., Kirkpatrick, D., & Werman, M.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1995-05
- Volume
- 17
- Issue
- 5
- Pages
- 529-533
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2119014534
- Cited by
- 454
- References
- 11
- FWCI
- 4.81
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Linear time Euclidean distance transform algorithms. https://app.cochat.ai/papers/10.1109/34.391389
- The paper
- Breu, H., Gil, J., Kirkpatrick, D., & Werman, M. (1995). Linear time Euclidean distance transform algorithms. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/34.391389
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.