Distance functions on digital pictures

Abstract

This paper describes algorithms for computing various functions on a digital picture which depend on the distance to a given subset of the picture. The algorithms involve local operations which are performed repeatedly, “in parallel”, on every picture element and its immediate neighbors. Applications to the detection of “clusters” and “regularities” in a picture, and to the dissection of a region into “pieces”, are also described.