Fast raster scan distance propagation on the discrete rectangular lattice

DOI10.1016/1049-9660(92)90008-QzbMATH Open0777.68092OpenAlexW2007301572MaRDI QIDQ3136086FDOQ3136086

Authors:

Publication date: 22 September 1993

Published in: CVGIP: Image Understanding (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/1049-9660(92)90008-q

Recommendations

• Fast distance transformation on irregular two-dimensional grids
• Rapid and accurate computation of the distance function using grids
• Fast computation of the Euclidean distance maps for binary images
• Exact Linear Time Euclidean Distance Transforms of Grid Line Sampled Shapes
• Fast 2-D Distance Transformations
• A fast robust algorithm for computing discrete Voronoi diagrams
• Scanline algorithms on a grid
• A fast algorithm for the rectilinear distance location problem

zbMATH Keywords

distance transforms

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Cited In (8)

• Discrete Geometry for Computer Imagery
• Automatically Controlled Morphing of 2D Shapes with Textures
• GPU-based Euclidean distance transforms and their application to volume rendering
• Sub-pixel distance maps and weighted distance transforms.
• Voronoi diagrams of polygons: a framework for shape representation.
• 3-D Voronoi tessellation algorithms
• Neighborhoods for distance transformations using ordered propagation
• On the validity of the two raster sequences distance transform algorithm

This page was built for publication: Fast raster scan distance propagation on the discrete rectangular lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3136086)