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 17 items.
- An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images (Q673013) (← links)
- 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)
- Parallel computation of distance transforms (Q1175646) (← links)
- Fast computation of the Euclidean distance maps for binary images (Q1199878) (← links)
- The Boolean map distance: theory and efficient computation (Q1690418) (← links)
- Morphological decomposition and compression of binary images via a minimum set cover algorithm (Q1716775) (← links)
- Linear time algorithms for exact distance transform (Q1932832) (← links)
- 3-D Voronoi tessellation algorithms (Q2388259) (← links)
- A general algorithm for computing distance transforms in linear time (Q2759989) (← 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)
- Separable Distance Transformation and Its Applications (Q4648753) (← links)
- A Discrete Bisector Function Based on Annulus (Q5237093) (← links)
- (Q5457097) (← links)