The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

The distance transform is a mathematical operator with a wide range of applications in computer vision. In the state-of-the art the mostly discussed distance transform is the Euclidean distance transform of binary images. In this paper we propose an algorithm for general distance transform of sampled functions. In our method the only restriction is that the defined distance has to be an increasing function for each component. The proposed algorithm is compared with the low parabolas algorithm which is one of the most performant. Experimental results show advantages in computation speed even for the Euclidean distance transform of high resolution images. The most important property of our method is the usability for any kind of distances.

Key words and phrases. general distance transform, Euclidean distance transform, binary search tree, sampled functions.