论文信息 - A Unified Linear-Time Algorithm for Computing Distance Maps - 字舞流文

A Unified Linear-Time Algorithm for Computing Distance Maps

In this paper we give a simple unified algorithm for computing distance maps. The algorithm runs in O(N 2 ) time for an imput of N×N binary image.

Tomio Hirata | T. Hirata

[1] Alok Aggarwal,et al. Geometric applications of a matrix-searching algorithm , 1987, SCG '86.

[2] H. Yamada. Complete Euclidean Distance Transformation by Parallel Poeration , 1984 .

[3] Gunilla Borgefors,et al. Distance transformations in digital images , 1986, Comput. Vis. Graph. Image Process..

[4] Kenji Kise,et al. An efficient algorithm for the euclidean distance transformation , 1996, Systems and Computers in Japan.

[5] P. Danielsson. Euclidean distance mapping , 1980 .

[6] Ling Chen,et al. A Fast Algorithm for Euclidean Distance Maps of a 2-D Binary Image , 1994, Inf. Process. Lett..

[7] Toshimitsu Masuzawa,et al. An optimal parallel algorithm for the Euclidean distance maps of binary images , 1995, Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing.

[8] Kiriakos N. Kutulakos,et al. Fast Computation of the Euclidian Distance Maps for Binary Images , 1992, Inf. Process. Lett..

[9] Azriel Rosenfeld,et al. Sequential Operations in Digital Picture Processing , 1966, JACM.