The DOI matches its Crossref record.
A General Algorithm for Computing Distance Transforms in Linear Time
Open accessAbstract
A new general algorithm for computing distance transforms of digital images is presented. The algorithm consists of two phases. Both phases consist of two scans, a forward and a backward scan. The first phase scans the image column-wise, while the second phase scans the image row-wise. Since the computation per row (column) is independent of the computation of other rows (columns), the algorithm can be easily parallelized on shared memory computers. The algorithm can be used for the computation of the exact Euclidean, Manhattan (L 1 norm), and chessboard distance (L ∞ norm) transforms.
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
Cited by
An Image Inpainting Technique Based on the Fast Marching Method
Telea, A. (2004) · Journal of Graphics Tools · doi:10.1080/10867651.2004.10487596 · Cited by 1,421
Morphological segmentation of binary patterns
Soille, P., & Vogt, P. (2009) · Pattern Recognition Letters · doi:10.1016/j.patrec.2008.10.015 · Cited by 705
Automatic Liver Segmentation Based on Shape Constraints and Deformable Graph Cut in CT Images
Li, G., Chen, X., Shi, F., Zhu, W., Tian, J., & Xiang, D. (2015) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2481326 · Cited by 185
Parallel centerline extraction on the GPU
Liu, B., Telea, A. C., Roerdink, J. B. T. M., Clapworthy, G. J., Williams, D., Yang, P., Dong, F., Codreanu, V., & Chiarini, A. (2014) · Computers & Graphics · doi:10.1016/j.cag.2014.02.003 · Cited by 14
Self-citation
Metadata
- Authors
- Meijster, A., Roerdink, J. B. T. M., & Hesselink, W. H.
- Venue
- Computational Imaging and Vision
- Publisher
- Kluwer Academic Publishers
- Published
- 2005-12-27
- Pages
- 331-340
- OpenAlex
- W1517229131
- Cited by
- 234
- References
- 0
- FWCI
- 16.81
- Type
- book chapter
- Language
- en
- Open access
- green
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: A General Algorithm for Computing Distance Transforms in Linear Time. https://app.cochat.ai/papers/10.1007/0-306-47025-x_36
- The paper
- Meijster, A., Roerdink, J. B. T. M., & Hesselink, W. H. (2005). A General Algorithm for Computing Distance Transforms in Linear Time. Computational Imaging and Vision. https://doi.org/10.1007/0-306-47025-x_36
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.