Linear-time border-tracing algorithms for quadtrees

DOI10.1007/BF01758835zbMath0753.68050OpenAlexW2039011603MaRDI QIDQ1188115

Robert E. Webber, Hanan Samet

Publication date: 13 August 1992

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01758835

zbMATH Keywords

chain codesconnected component labeling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The space efficiency of quadtrees
• Normalized quadtrees with respect to translations
• Region representation

This page was built for publication: Linear-time border-tracing algorithms for quadtrees