BDBComp
Parceria:
SBC
Fast Euclidean distance transform using a graph-search algorithm

Roberto de Alencar LotufoAlexandre A. FalcãoFrancisco A. Zampirolli

Two new Euclidean distance transform algorithms are described. The algorithms are designed using a shortest path graph-search framework. The distance transform can be seen as the solution of a shortest path forest problem. Previous works have dealt with the Euclidean distance transform (EDT) and with the shortest path forest problem, but none of them have presented an EDT using the graph-search approach. The proposed algorithms are very simple and yet belong to the class of one of the most efficient sequential algorithms. The algorithms easily extend to higher dimensions.

http://sibgrapi.sid.inpe.br/rep-/sid.inpe.br/banon/2002/11.13.11.53

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato: bdbcomp@lbd.dcc.ufmg.br
     Mantida por:
LBD