Pages that link to "Item:Q1175646"
From MaRDI portal
The following pages link to Parallel computation of distance transforms (Q1175646):
Displaying 11 items.
- MIMD divide-and-conquer algorithms for the distance transformation. Part I: City Block distance (Q672943) (← links)
- Parallel distance transforms on pyramid machines: Theory and implementation (Q804324) (← links)
- Parallel computation of the Hausdorff distance between images (Q1315933) (← links)
- A unified linear-time algorithm for computing distance maps (Q1350616) (← links)
- Medial axis transform on mesh-connected computers with hyperbus broadcasting (Q1377289) (← links)
- The calculation of average distance in mesh structures. (Q1416347) (← links)
- A cost optimal parallel algorithm for weighted distance transforms. (Q1606863) (← links)
- Constant time BSR solutions to \(L_ 1\) metric and digital geometry problems (Q1898084) (← links)
- Faster core-set constructions and data-stream algorithms in fixed dimensions (Q2507158) (← links)
- Optimal Computing the Chessboard Distance Transform on Parallel Processing Systems (Q4240143) (← links)
- The equivalence of the chessboard distance transform and the medial axis transform<sup>∗</sup> (Q4375396) (← links)