A general algorithm for computing distance transforms in linear time
From MaRDI portal
Recommendations
- Linear time algorithms for exact distance transform
- A linear time algorithm for computing the Euclidean distance transform in arbitrary dimensions
- In-place linear-time algorithms for Euclidean distance transform
- A unified linear-time algorithm for computing distance maps
- Combinatorial Image Analysis
- Exact Linear Time Euclidean Distance Transforms of Grid Line Sampled Shapes
- A linear time algorithm for the computation of some distance functions between convex polygons
Cited in
(42)- Efficient exploration of unknown indoor environments using a team of mobile robots
- A spherical parameterization approach based on symmetry analysis of triangular meshes
- Morphological decomposition and compression of binary images via a minimum set cover algorithm
- Euclidean distance-based skeletons: a few notes on average outward flux and ridgeness
- Linear time algorithms for exact distance transform
- Image-based effective medium approximation for fast permeability evaluation of porous media core samples
- A new boundary-based morphological model
- Locally adaptable mathematical morphology using distance transformations
- Vector-city vector distance transform
- Distance transforms of sampled functions
- Exact Linear Time Euclidean Distance Transforms of Grid Line Sampled Shapes
- Constant-work-space image scan with a given angle
- In-place linear-time algorithms for Euclidean distance transform
- Linear time distance transforms for quadtrees
- Another comment on “a note on ‘distance transformations in digital images’”
- GPU-based Euclidean distance transforms and their application to volume rendering
- 2D subquadratic separable distance transformation for path-based norms
- scientific article; zbMATH DE number 4211539 (Why is no real title available?)
- A novel algorithm for distance transformation on irregular isothetic grids
- The Euclidean distance transform in arbitrary dimensions
- Distance transform computation for digital distance functions
- Separable distance transformation and its applications
- Reconstruction of smooth 3D color functions from keypoints: application to lossy compression and exemplar-based generation of color LUTs
- A discrete bisector function based on annulus
- Discrete Geometry for Computer Imagery
- Parallel Chen-Han (PCH) algorithm for discrete geodesics
- Distance Transformation on Two-Dimensional Irregular Isothetic Grids
- Combinatorial Image Analysis
- Algorithms and Computation
- On the validity of the two raster sequences distance transform algorithm
- A novel distance transform for brain extraction from T1-W magnetic resonance images (MRI) of human head
- MIMD divide-and-conquer algorithms for the distance transformation. Part I: City Block distance
- MIMD divide-and-conquer algorithms for the distance transformation. Part II: Chamfer 3-4 distance
- NetXtractor: an efficient algorithm for pore network extraction from porous media images
- Hierarchy-based fuzzy segmentation and marker learning layer: theory and algorithms
- Convergence towards a local minimum by direct search methods with a covering step
- Efficient maximum Euclidean distance transform computation in component trees using the differential image foresting transform
- Skeleton sparsification and densification scale-spaces
- 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
- Hole filling in 3D volumetric objects
This page was built for publication: A general algorithm for computing distance transforms in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2759989)
