SIGN IN
SIGN UP
Fast Euclidean Distance Transform using a Graph-Search Algorithm
Authors:
Roberto de Alencar Lotufo
Alexandre X. Falcão
Francisco A. Zampirolli
Published in:
· Proceeding
SIBGRAPI '00 Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing
Pages 269-275
IEEE Computer Society
Washington, DC
, USA
©2000
table of contents
ISBN:0-7695-0878-2
2000 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 0
· Downloads (cumulative): 0
· Citation Count: 3
Tools and Resources
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Publisher Site
Share:
|
Tags:
fast euclidean distance transform
image processing
sequential algorithms
shortest path forest problem
shortest path graph-search
tree searching
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
Did you know the ACM DL App is now available?
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder