An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images
From MaRDI portal
(Redirected from Publication:673013)
Recommendations
Cites work
Cited in
(11)- A unified linear-time algorithm for computing distance maps
- Parallel computation of the Hausdorff distance between images
- A cost optimal parallel algorithm for weighted distance transforms.
- Computing the Euclidean distance transform on a linear array of processors
- Finding a minimal cover for binary images: An optimal parallel algorithm
- Optimal parallel algorithms for proximate points, with applications (extended abstract)
- Dynamics and topological aspects of a reconstructed two-dimensional foam time series using Potts model on a pinned lattice.
- A fast algorithm for Euclidean distance maps of a 2-D binary image
- The equivalence of the chessboard distance transform and the medial axis transform∗
- 3-D Voronoi tessellation algorithms
- Fast computation of the Euclidean distance maps for binary images
This page was built for publication: An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673013)