article

A unified linear-time algorithm for computing distance maps

Author:

Tomio HirataAuthors Info & Claims

Information Processing Letters, Volume 58, Issue 3

Pages 129 - 133

https://doi.org/10.1016/0020-0190(96)00049-X

Published: 13 May 1996 Publication History

Abstract

No abstract available.

Cited By

View all

Fuseiller GMarie RMourioux GDuno ELabbani-Igbida O(2022)Enhancing distance transform computation by leveraging the discrete nature of imagesJournal of Real-Time Image Processing10.1007/s11554-022-01221-319:4(763-773)Online publication date: 1-Aug-2022
https://dl.acm.org/doi/10.1007/s11554-022-01221-3
Marasca ABackes AFavarim FTeixeira MCasanova D(2021)EDT Method for Multiple Labelled Objects Subject to Tied DistancesInternational Journal of Automation and Computing10.1007/s11633-021-1285-018:3(468-479)Online publication date: 1-Jun-2021
https://dl.acm.org/doi/10.1007/s11633-021-1285-0
Zrour RAndres ESidibe SLenain RLargeteau-Skapin G(2021)A 2D and 3D discrete bisector function based on annulusPattern Analysis & Applications10.1007/s10044-021-00973-124:3(1135-1148)Online publication date: 1-Aug-2021
https://dl.acm.org/doi/10.1007/s10044-021-00973-1
Show More Cited By

Index Terms

A unified linear-time algorithm for computing distance maps

Recommendations

Constant-Time Algorithm for the Euclidean Distance Transform on Reconfigurable Meshes

The Euclidean distance transform (EDT) is an operation to convert a binary image consisting of black and white pixels to a representation where each pixel has the Euclidean distance of the nearest black pixel. The EDT has many applications in computer ...
Optimal Computing the Chessboard Distance Transform on Parallel Processing Systems

Thedistance transform(DT) is an image computation tool which can be used to extract the information about the shape and the position of the foreground pixels relative to each other. It converts a binary image into a grey-level image, where each pixel ...
Fast and scalable algorithms for the Euclidean distance transform on a linear array with a reconfigurable pipelined bus system

The Euclidean distance transform (EDT) is an operation to convert a binary image consisting of black and white pixels to a representation where each pixel has the Euclidean distance of the nearest black pixel. The EDT has many applications in computer ...

Comments

Information & Contributors

Information

Published In

Information Processing Letters Volume 58, Issue 3

May 13, 1996

48 pages

ISSN:0020-0190

Editors:
F. Dehne
Carleton Univ., Ottawa, Canada
,
D. Gries
Cornell Univ., Ithaca, NY
,
W. M. Turski
Warsaw Univ., Warsaw, Poland

Issue’s Table of Contents

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 13 May 1996

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

46
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Fuseiller GMarie RMourioux GDuno ELabbani-Igbida O(2022)Enhancing distance transform computation by leveraging the discrete nature of imagesJournal of Real-Time Image Processing10.1007/s11554-022-01221-319:4(763-773)Online publication date: 1-Aug-2022
https://dl.acm.org/doi/10.1007/s11554-022-01221-3
Marasca ABackes AFavarim FTeixeira MCasanova D(2021)EDT Method for Multiple Labelled Objects Subject to Tied DistancesInternational Journal of Automation and Computing10.1007/s11633-021-1285-018:3(468-479)Online publication date: 1-Jun-2021
https://dl.acm.org/doi/10.1007/s11633-021-1285-0
Zrour RAndres ESidibe SLenain RLargeteau-Skapin G(2021)A 2D and 3D discrete bisector function based on annulusPattern Analysis & Applications10.1007/s10044-021-00973-124:3(1135-1148)Online publication date: 1-Aug-2021
https://dl.acm.org/doi/10.1007/s10044-021-00973-1
Farazmanesh DTavakoli A(2019)Morphological Decomposition and Compression of Binary Images via a Minimum Set Cover AlgorithmJournal of Mathematical Imaging and Vision10.1007/s10851-018-0825-x61:1(71-83)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1007/s10851-018-0825-x
Tavakoli AFarazmanesh D(2019)Unifying the skeletonization methods via modifying imagesPattern Analysis & Applications10.1007/s10044-018-0751-y22:3(919-933)Online publication date: 1-Aug-2019
https://dl.acm.org/doi/10.1007/s10044-018-0751-y
Sidibe SZrour RAndres ELargeteau-Skapin G(2019)A Discrete Bisector Function Based on AnnulusDiscrete Geometry for Computer Imagery10.1007/978-3-030-14085-4_37(469-480)Online publication date: 26-Mar-2019
https://dl.acm.org/doi/10.1007/978-3-030-14085-4_37
Zhu HLiu YWang HZhao J(2018)Efficient construction of the medial axis for a CAD model using parallel computingEngineering with Computers10.1007/s00366-017-0549-334:3(413-429)Online publication date: 1-Jul-2018
https://dl.acm.org/doi/10.1007/s00366-017-0549-3
Marie RLabbani-Igbida OMouaddib E(2016)The Delta Medial AxisPattern Recognition10.1016/j.patcog.2016.02.01156:C(26-39)Online publication date: 1-Aug-2016
https://dl.acm.org/doi/10.1016/j.patcog.2016.02.011
Gonzalez-Lorenzo ABac AMari JReal P(2016)Two Measures for the Homology Groups of Binary VolumesProceedings of the 19th IAPR International Conference on Discrete Geometry for Computer Imagery - Volume 964710.1007/978-3-319-32360-2_12(154-165)Online publication date: 18-Apr-2016
https://dl.acm.org/doi/10.1007/978-3-319-32360-2_12
Zhu HLiu YBai JYe X(2015)Constructive generation of the medial axis for solid modelsComputer-Aided Design10.1016/j.cad.2014.11.00362:C(98-111)Online publication date: 1-May-2015
https://dl.acm.org/doi/10.1016/j.cad.2014.11.003
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Constant-Time Algorithm for the Euclidean Distance Transform on Reconfigurable Meshes

Optimal Computing the Chessboard Distance Transform on Parallel Processing Systems

Fast and scalable algorithms for the Euclidean distance transform on a linear array with a reconfigurable pipelined bus system

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations