
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Kunio Aizawa, Shojiro Tanaka, "A ConstantTime Algorithm for Finding Neighbors in Quadtrees," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 31, no. 7, pp. 11781183, July, 2009.  
BibTex  x  
@article{ 10.1109/TPAMI.2008.145, author = {Kunio Aizawa and Shojiro Tanaka}, title = {A ConstantTime Algorithm for Finding Neighbors in Quadtrees}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {31}, number = {7}, issn = {01628828}, year = {2009}, pages = {11781183}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2008.145}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  A ConstantTime Algorithm for Finding Neighbors in Quadtrees IS  7 SN  01628828 SP1178 EP1183 EPD  11781183 A1  Kunio Aizawa, A1  Shojiro Tanaka, PY  2009 KW  Image processing KW  quadtrees KW  linear quadtrees KW  neighbor finding. VL  31 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
[1] G. Schrack, “Finding Neighbors of Equal Size in Linear Quadtrees and Octrees in Constant Time,” CVGIP: Image Understanding, vol. 55, pp. 221230, 1992.
[2] R.A. Finkel and J.L. Bentley, “Quad Trees: A Data Structure for Retrieval on Composite Keys,” Acta Informatica, vol. 4, pp. 19, 1974.
[3] H. Samet, “Distance Transform for Images Represented by Quadtrees,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 4, pp. 298303, 1982.
[4] H. Samet, “A Quadtree Medial Axis Transform,” Comm. ACM, vol. 26, pp. 680693, 1983.
[5] H. Samet, “A TopDown Quadtree Traversal Algorithm,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 7, pp. 9498, 1985.
[6] D.R. Fuhrmann, “Quadtree Traversal Algorithms for PointerBased and DepthFirst Representations,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, pp. 955960, 1988.
[7] H. Samet, “Neighbor Finding Techniques for Images Represented by Quadtrees,” Computer Graphics and Image Processing, vol. 18, pp.3557, 1982.
[8] H. Samet, “Neighbor Finding in Images Represented by Octrees,” Computer Vision, Graphics, and Image Processing, vol. 46, pp. 367386, 1989.
[9] S.N. Yang and R.R. Lee, “Efficient Parallel Neighbor Finding Algorithms for Quadtrees on Hypercubes,” J. Information Science and Eng., vol. 9, pp. 81102, 1993.
[10] J. Vörös, “A Strategy for Repetitive Neighbor Finding in Images Represented by Quadtrees,” Pattern Recognition Letters, vol. 18, pp.955962, 1997.
[11] H. Samet, The Design and Analysis of Spatial Data Structures. AddisonWesley, 1990.
[12] H. Samet, Applications of Spacial Data Structures: Computer Graphics, Image Processing, and GIS. AddisonWesley, 1990.
[13] I. Gargantini, “An Effective Way to Represent Quadtrees,” Comm. ACM, vol. 25, pp. 905910, 1982.
[14] M.D. Berg, M.V. Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry. Springer, 1998.