Pages that link to "Item:Q673013"

The following pages link to An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images (Q673013):

Displaying 12 items.

• Finding a minimal cover for binary images: An optimal parallel algorithm (Q1175643) (← links)
• Fast computation of the Euclidean distance maps for binary images (Q1199878) (← links)
• Parallel computation of the Hausdorff distance between images (Q1315933) (← 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)
• Parallel computation of exact Euclidean distance transform (Q1351685) (← links)
• Computing the Euclidean distance transform on a linear array of processors (Q1404307) (← links)
• Dynamics and topological aspects of a reconstructed two-dimensional foam time series using Potts model on a pinned lattice. (Q1418628) (← links)
• A cost optimal parallel algorithm for weighted distance transforms. (Q1606863) (← links)
• 3-D Voronoi tessellation algorithms (Q2388259) (← links)
• The equivalence of the chessboard distance transform and the medial axis transform^∗ (Q4375396) (← links)
• Optimal parallel algorithms for proximate points, with applications (Q5096941) (← links)