Pixel queue algorithm for geodesic distance transforms

DOI10.1007/978-3-540-31965-8_22MaRDI QIDQ5316531zbMATH OpenOpenAlexFDO

Authors Leena Ikonen

Publication date 13 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b135490

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Recommendations

• A general algorithm for computing distance transforms in linear time
• Efficient Computation of the Euclidean Distance Transform
• Fast raster scan distance propagation on the discrete rectangular lattice
• An efficient Euclidean distance transform
• Distance transform computation for digital distance functions

Cited in

(9)

• Neighborhoods for distance transformations using ordered propagation
• Shortest route on gray-level map using distance transform on curved space
• An Objective Comparison Between Gray Weighted Distance Transforms and Weighted Distance Transforms on Curved Spaces
• Distance Transforms on Anisotropic Surfaces for Surface Roughness Measurement
• Parallel Chen-Han (PCH) algorithm for discrete geodesics
• Adaptive Morphological Filtering Using Similarities Based on Geodesic Time
• Shortest route on height map using gray-level distance transforms.
• A survey of motion planning algorithms from the perspective of autonomous UAV guidance
• Sub-pixel distance maps and weighted distance transforms.

This page was built for publication: Pixel queue algorithm for geodesic distance transforms

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