Exact Linear Time Euclidean Distance Transforms of Grid Line Sampled Shapes
From MaRDI portal
Publication:2946852
DOI10.1007/978-3-319-18720-4_54zbMath1445.68302OpenAlexW2150118857MaRDI QIDQ2946852
Joakim Lindblad, Nataša Sladoje
Publication date: 18 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-18720-4_54
Related Items (2)
Cites Work
- A graph-based framework for sub-pixel image segmentation
- Sub-pixel distance maps and weighted distance transforms.
- A unified linear-time algorithm for computing distance maps
- Linear time algorithms for exact distance transform
- Anti-Aliased Euclidean Distance Transform on 3D Sampling Lattices
- Distance Transformation on Two-Dimensional Irregular Isothetic Grids
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Exact Linear Time Euclidean Distance Transforms of Grid Line Sampled Shapes