Linear time distance transforms for quadtrees

DOI10.1016/1049-9660(91)90064-VzbMATH Open0777.68099OpenAlexW2168487217MaRDI QIDQ3136107FDOQ3136107

Authors: Clifford A. Shaffer, Q. F. Stout 

Publication date: 22 September 1993

Published in: CVGIP: Image Understanding (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/1049-9660(91)90064-v

Recommendations

• A general algorithm for computing distance transforms in linear time
• In-place linear-time algorithms for Euclidean distance transform
• Parallel computation of distance transforms
• A unified linear-time algorithm for computing distance maps
• Linear-time border-tracing algorithms for quadtrees

zbMATH Keywords

quadtreechessboard distance transformtree traversals

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Computing methodologies for image processing (68U10)

Cited In (5)

• Variant code transformations for linear quadtrees
• Title not available (Why is that?)
• Analysis of the worst case space complexity of a PR quadtree
• Set operations on linear quadtrees
• Linear time algorithms for exact distance transform

This page was built for publication: Linear time distance transforms for quadtrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3136107)