Finding neighbors of equal size in linear quadtrees and octrees in constant time

DOI10.1016/1049-9660(92)90022-UMaRDI QIDQ3136053zbMATH OpenFDO

Authors Günther F. Schrack

Publication date 22 September 1993

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

zbMATH Keywords

image processingcomputer graphicssolid modelingoctreesneighborsLinear quadtreeslocation codesspatial addresses

Mathematics Subject Classification ID

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

Recommendations

• Neighbor finding techniques for images represented by quadtrees
• Simple and Efficient Traversal Methods for Quadtrees and Octrees
• Set operations on linear quadtrees
• Linear-time border-tracing algorithms for quadtrees
• The Use of Linear Quadtrees in a Numerical Problem

Cited in

(6)

• Linear hypertree for multi-dimensional image representation
• Simple and Efficient Traversal Methods for Quadtrees and Octrees
• Generic support of algorithmic and structural recursion for scientific computing
• Neighbor finding techniques for images represented by quadtrees
• Variant code transformations for linear quadtrees
• Statistical optimization of octree searches

This page was built for publication: Finding neighbors of equal size in linear quadtrees and octrees in constant time

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