Close
Metadata

@InProceedings{LotufoFalcZamp:2000:FaEuDi,
               author = "Lotufo, Roberto A. and Falc{\~a}o, Alexandre A. and Zampirolli, 
                         Francisco A.",
                title = "Fast Euclidean distance transform using a graph-search algorithm",
                 year = "2000",
               editor = "Carvalho, Paulo Cezar Pinto and Walter, Marcelo",
                pages = "269--275",
         organization = "Brazilian Symposium on Computer Graphics and Image Processing, 13. 
                         (SIBGRAPI)",
            publisher = "IEEE Computer Society",
              address = "Los Alamitos",
                 note = "The conference was held in Gramado, RS, Brazil, from October 17 to 
                         20.",
             keywords = "tree searching, Fast Euclidean distance transform, shortest path 
                         forest problem, shortest path graph-search, sequential algorithms, 
                         image processing.",
             abstract = "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.",
  conference-location = "Gramado, RS, Brazil",
      conference-year = "October",
         organisation = "SBC - Brazilian Computer Society",
           targetfile = "269-275.pdf",
        urlaccessdate = "2020, Nov. 29"
}


Close