• DOI:10.1145/358728.358741
Corpus ID: 14988647

An effective way to represent quadtrees

@article{Gargantini1982AnEW,
  title={An effective way to represent quadtrees},
  author={I. Gargantini},
  journal={Commun. ACM},
  year={1982},
  volume={25},
  pages={905-910}
}

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

View on ACM

cse.usf.edu

Save to Library

Create Alert

Cite

Launch Research Feed