Pages that link to "Item:Q2780003"
From MaRDI portal
The following pages link to A linear time algorithm for computing the Euclidean distance transform in arbitrary dimensions (Q2780003):
Displaying 12 items.
- Efficient Euclidean distance transform algorithm of binary images in arbitrary dimensions (Q456033) (← links)
- A linear-time algorithm for Euclidean feature transform sets (Q846000) (← links)
- Fast computation of the Euclidean distance maps for binary images (Q1199878) (← links)
- A fast algorithm for Euclidean distance maps of a 2-D binary image (Q1328760) (← links)
- A unified linear-time algorithm for computing distance maps (Q1350616) (← 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)
- 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)
- Efficient Computation of the Euclidean Distance Transform (Q4800577) (← links)
- Algorithms and Computation (Q5897933) (← links)
- Discrete Geometry for Computer Imagery (Q5902453) (← links)
