The equivalence of the chessboard distance transform and the medial axis transform∗

DOI10.1080/00207169708804608MaRDI QIDQ4375396zbMATH OpenOpenAlexFDO

Authors Yu-Hua Lee, Shi-Jinn Horng

Publication date 13 July 1998

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169708804608

zbMATH Keywords

distance transformimage computation toolsmedial axis transform

Mathematics Subject Classification ID

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

Recommendations

• Optimal Computing the Chessboard Distance Transform on Parallel Processing Systems
• Distance transform computation for digital distance functions
• Chamfer metrics, the medial axis and mathematical morphology.

Cites work

• A fast algorithm for Euclidean distance maps of a 2-D binary image
• An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images
• Another comment on “a note on ‘distance transformations in digital images’”
• Fast computation of the Euclidean distance maps for binary images
• Parallel computation of distance transforms
• Parallel computational geometry of rectangles

Cited in

(3)

• A unified Pythagorean hodograph approach to the medial axis transform and offset approximation
• Look-up tables for medial axis on squared Euclidean distance transform.
• Conformal mapping in linear time

This page was built for publication: The equivalence of the chessboard distance transform and the medial axis transform^∗

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