We present a novel graph-theoretic approach to the Distance Transforma
tion (DT) problem. The binary digital image is considered as a graph a
nd the DT problem reduces to a shortest path forest problem. An algori
thm is presented which solves the chamfer DT, and the Euclidian DT for
a given bound.