A linear-time algorithm for Euclidean feature transform sets

DOI10.1016/j.ipl.2006.12.005zbMath1184.68562OpenAlexW1988695203MaRDI QIDQ846000

Wim H. Hesselink

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://pure.rug.nl/ws/files/2800816/2007InfProcLettHesselink.pdf

zbMATH Keywords

algorithmsimage processingcomputational geometrydistance transformfeature transform

Mathematics Subject Classification ID

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

Related Items (1)

Morphological decomposition and compression of binary images via a minimum set cover algorithm

Cites Work

• Unnamed Item
• A fast algorithm for Euclidean distance maps of a 2-D binary image
• A unified linear-time algorithm for computing distance maps
• Discrete Geometry for Computer Imagery
• Sequential Operations in Digital Picture Processing

This page was built for publication: A linear-time algorithm for Euclidean feature transform sets