An efficient Euclidean distance transform
From MaRDI portal
Recommendations
- Efficient Computation of the Euclidean Distance Transform
- In-place linear-time algorithms for Euclidean distance transform
- A linear-time algorithm for Euclidean feature transform sets
- A general algorithm for computing distance transforms in linear time
- Fast computation of the Euclidean distance maps for binary images
Cited in
(23)- A fast algorithm for Euclidean distance maps of a 2-D binary image
- Vector-city vector distance transform
- A general algorithm for computing distance transforms in linear time
- Space-Efficient Approximation Scheme for Circular Earth Mover Distance
- Distance transforms of sampled functions
- Exact Linear Time Euclidean Distance Transforms of Grid Line Sampled Shapes
- In-place linear-time algorithms for Euclidean distance transform
- Euclidean Ordering via Chamfer Distance Calculations
- Distance transform computation for digital distance functions
- Image matching using distance transform
- Separable distance transformation and its applications
- Corrigendum to “Efficient Computation of the Euclidean Distance Transform”
- Efficient Computation of the Euclidean Distance Transform
- Approximation of the Euclidean distance by chamfer distances
- Distance Transform Based on Weight Sequences
- Pixel queue algorithm for geodesic distance transforms
- Elliptical Distance Transforms and Applications
- Euclidean Eccentricity Transform by Discrete Arc Paving
- Discrete Geometry for Computer Imagery
- On the validity of the two raster sequences distance transform algorithm
- A linear-time algorithm for Euclidean feature transform sets
- Sub-pixel distance maps and weighted distance transforms.
- Fast distance transformation on irregular two-dimensional grids
This page was built for publication: An efficient Euclidean distance transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465741)
