An effective way to represent quadtrees

  title={An effective way to represent quadtrees},
  author={I. Gargantini},
  journal={Commun. ACM},
  • I. Gargantini
  • Published 1982
  • Computer Science
  • Commun. ACM
  • A quadtree may be represented without pointers by encoding each black node with a quaternary integer whose digits reflect successive quadrant subdivisions. We refer to the sorted array of black nodes as the “linear quadtree” and show that it introduces a saving of at least 66 percent of the computer storage required by regular quadtrees. Some algorithms using linear quadtrees are presented, namely, (<italic>i</italic>) encoding a pixel from a 2<supscrpt><italic>n</italic></supscrpt> × 2… CONTINUE READING
    718 Citations

    Paper Mentions

    Translation, Rotation and Superposition of Linear Quadtrees
    • I. Gargantini
    • Mathematics, Computer Science
    • Int. J. Man Mach. Stud.
    • 1983
    • 48
    Multi-colored quadtrees for GIS: Exploiting bit-parallelism for rapid boolean overlay
    • 2
    Data structures for quadtree approximation and compression
    • H. Samet
    • Mathematics, Computer Science
    • CACM
    • 1985
    • 105
    • PDF
    Comment on Quad- and Octtrees
    • 58
    Data Structures for Quadtree
    Algorithm to expand regions represented by linear quadtrees
    • 5
    • PDF
    Quadtrees and Morton Indexing
    • 1
    Compressed quadtree with content-addressable memory
    • D. Yang
    • Computer Science
    • Proceedings of 1st International Conference on Image Processing
    • 1994
    • PDF
    Parallel Processing of Linear Quadtrees on a Mesh-Connected Computer
    • 32