Linear time distance transforms for quadtrees

DOI10.1016/1049-9660(91)90064-VMaRDI QIDQ3136107zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

chessboard distance transformquadtreetree traversals

Mathematics Subject Classification ID

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

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

Cited in

(6)

• Linear-time border-tracing algorithms for quadtrees
• Analysis of the worst case space complexity of a PR quadtree
• Linear time algorithms for exact distance transform
• Set operations on linear quadtrees
• scientific article; zbMATH DE number 1869802 (Why is no real title available?)
• Variant code transformations for linear quadtrees

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)