Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Efficient Euclidean distance transform algorithm of binary images in arbitrary dimensions

From MaRDI portal
Publication:456033
Jump to:navigation, search

DOI10.1016/j.patcog.2012.07.030zbMath1248.68539OpenAlexW2078510396MaRDI QIDQ456033

Ying Tan, Jun Wang

Publication date: 23 October 2012

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2012.07.030


zbMATH Keywords

linear time algorithmbinary imagearbitrary dimensionsEuclidean distance transformindependent scan


Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)


Related Items (1)

On the role of distance transformations in Baddeley's delta metric




This page was built for publication: Efficient Euclidean distance transform algorithm of binary images in arbitrary dimensions

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:456033&oldid=12331846"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 05:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki