Pages that link to "Item:Q1199878"

The following pages link to Fast computation of the Euclidean distance maps for binary images (Q1199878):

Displaying 13 items.

• An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images (Q673013) (← links)
• An efficient algorithm for complete Euclidean distance transform on mesh-connected SIMD (Q673537) (← 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)
• Dynamics and topological aspects of a reconstructed two-dimensional foam time series using Potts model on a pinned lattice. (Q1418628) (← links)
• 3-D Voronoi tessellation algorithms (Q2388259) (← links)
• (Q3102039) (← links)
• Fast raster scan distance propagation on the discrete rectangular lattice (Q3136086) (← links)
• COMPUTATION OF MINKOWSKI MEASURES ON 2D AND 3D BINARY IMAGES (Q3598447) (← links)
• The equivalence of the chessboard distance transform and the medial axis transform^∗ (Q4375396) (← links)
• Combinatorial Image Analysis (Q5465741) (← links)
• Constant-time algorithm for the Euclidean distance transform on reconfigurable meshes. (Q5959183) (← links)