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} }
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
Paper Mentions
Blog Post
718 Citations
Translation, Rotation and Superposition of Linear Quadtrees
- Mathematics, Computer Science
- Int. J. Man Mach. Stud.
- 1983
- 48
Multi-colored quadtrees for GIS: Exploiting bit-parallelism for rapid boolean overlay
- Mathematics, Computer Science
- Pattern Recognit. Lett.
- 1988
- 2
Data structures for quadtree approximation and compression
- Mathematics, Computer Science
- CACM
- 1985
- 105
- PDF
Algorithm to expand regions represented by linear quadtrees
- Computer Science
- Image Vis. Comput.
- 1988
- 5
- PDF
Compressed quadtree with content-addressable memory
- Computer Science
- Proceedings of 1st International Conference on Image Processing
- 1994
Parallel Processing of Linear Quadtrees on a Mesh-Connected Computer
- Computer Science
- J. Parallel Distributed Comput.
- 1989
- 32