The equivalence of the chessboard distance transform and the medial axis transform∗
From MaRDI portal
Publication:4375396
DOI10.1080/00207169708804608zbMATH Open0891.68124OpenAlexW1967845265MaRDI QIDQ4375396FDOQ4375396
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
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)
Cites Work
- Parallel computational geometry of rectangles
- Fast computation of the Euclidean distance maps for binary images
- 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
- Parallel computation of distance transforms
- Another comment on “a note on ‘distance transformations in digital images’”
Cited In (2)
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)