Combinatorial Image Analysis
From MaRDI portal
Publication:5465741
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
(22)- Elliptical Distance Transforms and Applications
- Discrete Geometry for Computer Imagery
- Space-Efficient Approximation Scheme for Circular Earth Mover Distance
- Fast distance transformation on irregular two-dimensional grids
- Approximation of the Euclidean distance by chamfer distances
- A fast algorithm for Euclidean distance maps of a 2-D binary image
- A linear-time algorithm for Euclidean feature transform sets
- Efficient Computation of the Euclidean Distance Transform
- scientific article; zbMATH DE number 2044089 (Why is no real title available?)
- Distance transforms of sampled functions
- Sub-pixel distance maps and weighted distance transforms.
- Distance transform computation for digital distance functions
- Euclidean Eccentricity Transform by Discrete Arc Paving
- In-place linear-time algorithms for Euclidean distance transform
- A general algorithm for computing distance transforms in linear time
- Separable distance transformation and its applications
- Discrete Geometry for Computer Imagery
- Corrigendum to “Efficient Computation of the Euclidean Distance Transform”
- On the validity of the two raster sequences distance transform algorithm
- Exact Linear Time Euclidean Distance Transforms of Grid Line Sampled Shapes
- Vector-city vector distance transform
- Distance Transform Based on Weight Sequences
This page was built for publication: Combinatorial Image Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465741)
