Efficient Computation of the Euclidean Distance Transform

Recommendations

Combinatorial Image Analysis
Efficient Euclidean distance transform algorithm of binary images in arbitrary dimensions
A linear time algorithm for computing the Euclidean distance transform in arbitrary dimensions
A Work Efficient Parallel Algorithm for Exact Euclidean Distance Transform
Parallel computation of exact Euclidean distance transform
In-place linear-time algorithms for Euclidean distance transform
Computing the Euclidean distance transform on a linear array of processors
The Euclidean distance transform in arbitrary dimensions

Cited in

(26)

Discrete Geometry for Computer Imagery
Euclidean Eccentricity Transform by Discrete Arc Paving
Sub-pixel distance maps and weighted distance transforms.
On the role of distance transformations in Baddeley's delta metric
GPU-based Euclidean distance transforms and their application to volume rendering
Distance transforms of sampled functions
Combinatorial Image Analysis
Fast distance transformation on irregular two-dimensional grids
A novel algorithm for distance transformation on irregular isothetic grids
Exact Linear Time Euclidean Distance Transforms of Grid Line Sampled Shapes
Distance transform computation for digital distance functions
Space-Efficient Approximation Scheme for Circular Earth Mover Distance
Corrigendum to “Efficient Computation of the Euclidean Distance Transform”
In-place linear-time algorithms for Euclidean distance transform
Elliptical Distance Transforms and Applications
A linear time algorithm for computing the Euclidean distance transform in arbitrary dimensions
A linear-time algorithm for Euclidean feature transform sets
A fast algorithm for Euclidean distance maps of a 2-D binary image
Constant-time algorithm for the Euclidean distance transform on reconfigurable meshes.
The Euclidean distance transform in arbitrary dimensions
Design of a cellular architecture for fast computation of the skeleton
Algorithms and Computation
Efficient Euclidean distance transform algorithm of binary images in arbitrary dimensions
Fast computation of the Euclidean distance maps for binary images
Fast and scalable algorithms for the Euclidean distance transform on a linear array with a reconfigurable pipelined bus system
Discrete Geometry for Computer Imagery

This page was built for publication: Efficient Computation of the Euclidean Distance Transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4800577)