Applications of the region growing Euclidean distance transform: anisotropy and skeletons

Abstract

A new region growing algorithm has been proposed for computing Euclidean distance maps in a time comparable to widely used chamfer distance transform. We show how this algorithm can be extended to more complex tasks such as the computation of distance maps on anisotropic grids and the generation of a new type of Euclidean skeletons.