Pages that link to "Item:Q1350616"
From MaRDI portal
The following pages link to A unified linear-time algorithm for computing distance maps (Q1350616):
Displaying 8 items.
- A linear-time algorithm for Euclidean feature transform sets (Q846000) (← links)
- Finding a minimum medial axis of a discrete shape is NP-hard (Q952462) (← links)
- Some theoretical challenges in digital geometry: a perspective (Q967394) (← links)
- Visible vectors and discrete Euclidean medial axis (Q1042454) (← links)
- Morphological decomposition and compression of binary images via a minimum set cover algorithm (Q1716775) (← links)
- 3-D Voronoi tessellation algorithms (Q2388259) (← links)
- Exact Linear Time Euclidean Distance Transforms of Grid Line Sampled Shapes (Q2946852) (← links)
- Appearance Radii in Medial Axis Test Mask for Small Planar Chamfer Norms (Q3648805) (← links)
