Showing papers by "Per-Erik Danielsson published in 1997"

TL;DR: This paper deals with the problem of finding the most efficient version of this representation which is called the minimal set of maximum disks (MSD), and the proposed algorithm picks candidate disks from the local maxima in the Euclidean distance transform.