Pages that link to "Item:Q1351685"
From MaRDI portal
The following pages link to Parallel computation of exact Euclidean distance transform (Q1351685):
Displaying 8 items.
- MIMD divide-and-conquer algorithms for the distance transformation. Part II: Chamfer 3-4 distance (Q672944) (← links)
- An efficient algorithm for complete Euclidean distance transform on mesh-connected SIMD (Q673537) (← links)
- Parallel distance transforms on pyramid machines: Theory and implementation (Q804324) (← links)
- Parallel computation of distance transforms (Q1175646) (← links)
- Parallel computation of the Hausdorff distance between images (Q1315933) (← links)
- Computing the Euclidean distance transform on a linear array of processors (Q1404307) (← links)
- Efficient Computation of the Euclidean Distance Transform (Q4800577) (← links)
- A PARALLEL ARCHITECTURE FOR CURVE-EVOLUTION PARTIAL DIFFERENTIAL EQUATIONS (Q4977605) (← links)