Thumbnail
Access Restriction
Subscribed

Author Fabbri, Ricardo ♦ Costa, Luciano Da F. ♦ Torelli, Julio C. ♦ Bruno, Odemir M.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2008
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Dijkstra's algorithm ♦ Distance transform ♦ Computational geometry ♦ Exact Euclidean distance map ♦ Performance evaluation ♦ Shape analysis
Abstract The distance transform (DT) is a general operator forming the basis of many methods in computer vision and geometry, with great potential for practical applications. However, all the optimal algorithms for the computation of the exact Euclidean DT (EDT) were proposed only since the 1990s. In this work, state-of-the-art sequential 2D EDT algorithms are reviewed and compared, in an effort to reach more solid conclusions regarding their differences in speed and their exactness. Six of the best algorithms were fully implemented and compared in practice.
ISSN 03600300
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2008-02-01
Publisher Place New York
e-ISSN 15577341
Journal ACM Computing Surveys (CSUR)
Volume Number 40
Issue Number 1
Page Count 44
Starting Page 1
Ending Page 44


Open content in new tab

   Open content in new tab
Source: ACM Digital Library