This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Model for the Analysis of Neighbor Finding in Pointer-Based Quadtrees
June 1985 (vol. 7 no. 6)
pp. 717-720
Hanan Samet, Department of Computer Science and the Center for Automation Research, University of Maryland, College Park, MD 20742.
Clifford A. Shaffer, Department of Computer Science and the Center for Automation Research, University of Maryland, College Park, MD 20742.
A natural byproduct of the tree-like nature of the quadtree is that many basic image processing operations can be implemented as tree traversals which differ in the nature of the computation that is performed at each node. Some of these computations involve the inspection of a node's adjacent neighbors (termed neighbor finding). A new model is developed for images represented by quadtrees, and it is used to analyze various neighbor-finding techniques. The model's predicted costs for neighbor finding correlate very closely with empirical results and it is superior to the model that was used previously.
Citation:
Hanan Samet, Clifford A. Shaffer, "A Model for the Analysis of Neighbor Finding in Pointer-Based Quadtrees," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 7, no. 6, pp. 717-720, June 1985, doi:10.1109/TPAMI.1985.4767729
Usage of this product signifies your acceptance of the Terms of Use.