Efficient computation of the Euclidean distance transform

Laurence Boxer; Russ Miller

doi:10.1006/cviu.2000.0880

Efficient computation of the Euclidean distance transform

Laurence Boxer
, Russ Miller

Department of Computer Science and Engineering

Niagara University
SUNY Buffalo

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

Abstract

We present a simple algorithm for the Euclidean distance transform of a binary image that runs more efficiently than other algorithms in the literature. We show that our algorithm runs in optimal time for many architectures and has optimal cost for the RAM and EREW PRAM.

Original language	English
Pages (from-to)	379-383
Number of pages	5
Journal	Computer Vision and Image Understanding
Volume	80
Issue number	3
DOIs	https://doi.org/10.1006/cviu.2000.0880
State	Published - Dec 2000

Access to Document

10.1006/cviu.2000.0880

Cite this

@article{f0570140175942988636882b22861053,

title = "Efficient computation of the Euclidean distance transform",

abstract = "We present a simple algorithm for the Euclidean distance transform of a binary image that runs more efficiently than other algorithms in the literature. We show that our algorithm runs in optimal time for many architectures and has optimal cost for the RAM and EREW PRAM.",

author = "Laurence Boxer and Russ Miller",

year = "2000",

month = dec,

doi = "10.1006/cviu.2000.0880",

language = "English",

volume = "80",

pages = "379--383",

journal = "Computer Vision and Image Understanding",

issn = "1077-3142",

publisher = "Academic Press Inc.",

number = "3",

}

TY - JOUR

T1 - Efficient computation of the Euclidean distance transform

AU - Boxer, Laurence

AU - Miller, Russ

PY - 2000/12

Y1 - 2000/12

N2 - We present a simple algorithm for the Euclidean distance transform of a binary image that runs more efficiently than other algorithms in the literature. We show that our algorithm runs in optimal time for many architectures and has optimal cost for the RAM and EREW PRAM.

AB - We present a simple algorithm for the Euclidean distance transform of a binary image that runs more efficiently than other algorithms in the literature. We show that our algorithm runs in optimal time for many architectures and has optimal cost for the RAM and EREW PRAM.

UR - https://www.scopus.com/pages/publications/0034475486

U2 - 10.1006/cviu.2000.0880

DO - 10.1006/cviu.2000.0880

M3 - Article

AN - SCOPUS:0034475486

SN - 1077-3142

VL - 80

SP - 379

EP - 383

JO - Computer Vision and Image Understanding

JF - Computer Vision and Image Understanding

IS - 3

ER -

Efficient computation of the Euclidean distance transform

Abstract

Access to Document

Other files and links

Fingerprint

Cite this