This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Space and Time Efficient Virtual Quadtress
February 1984 (vol. 6 no. 2)
pp. 244-247
Leslie P. Jones, Department of Computer Science, Louisiana State University, Baton Rouge, LA 70803; Department of Computer Science, Marietta College, Marietta, OH 45750.
S. Sitharama Iyengar, Department of Computer Science, Louisiana State University, Baton Rouge, LA 70803.
The quadtree has recently become a major data structure in image processing. This correspondence investigates ways in which quadtrees may be efficiently stored as a forest of quadtrees and as a new structure we call a compact quadtree. These new structures are called virtual quadtrees because the basic operations we expect to perform in moving about within a quadtree can also be performed on the new representations. Space and time efficiency are investigated and it is shown these new structures often given an improvement in both.
Citation:
Leslie P. Jones, S. Sitharama Iyengar, "Space and Time Efficient Virtual Quadtress," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 6, no. 2, pp. 244-247, Feb. 1984, doi:10.1109/TPAMI.1984.4767508
Usage of this product signifies your acceptance of the Terms of Use.