In image processing, the distancetransform (DT), in which each object grid point is assigned the distance to the closest background grid point, is a powerful and often used tool. In this paper, distancefunctions defined as minimal cost-paths are used and a number of algorithms that can be used to compute the DT are presented. We give proofs of the correctness of the algorithms.