This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Exact Closed-Form Formula for d-Dimensional Quadtree Decomposition of Arbitrary Hyperrectangles
June 2006 (vol. 18 no. 6)
pp. 784-798
In this paper, we solve the classic problem of computing the average number of decomposed quadtree blocks (quadrants, nodes, or pieces) in quadtree decomposition for an arbitrary hyperrectangle aligned with the axes. We derive a closed-form formula for general cases. The previously known state-of-the-art solution provided a closed-form solution for special cases and utilized these formulas to derive linearly interpolated formulas for general cases individually. However, there is no exact and uniform closed-form formula that fits all cases. Contrary to the top-down counting approach used by most prior solutions, we employ a bottom-up enumeration approach to transform the problem into one that involves the Cartesian product of d multisets of successive 2's powers. Classic combinatorial enumeration techniques are applied to obtain an exact and uniform closed-form formula. The result is of theoretical interest since it is the first exact closed-form formula for arbitrary cases. Practically, it is nice to have a uniform formula for estimating the average number since a simple program can be conveniently constructed taking side lengths as inputs.

[1] W.G. Aref and H. Samet, “Decomposing a Window into Maximal Quadtree Blocks,” Acta Informatica, vol. 30, pp. 425-439, 1993.
[2] D.H. Ballard and C.M. Brown, Computer Vision. Prentice Hall, 1982.
[3] E.A. Bender and S.G. Williamson, Mathematics for Algorithm and Systems Analysis. Dover, 2005. http://www.math.ucsd.edu/~ebenderDiscreteText2 .
[4] K.P. Bogart, Introductory Combinatorics. Pitman, 1983.
[5] C.R. Dyer, “The Space Efficiency of Quadtrees,” Computer Graphics and Image Processing, vol. 19, no. 4, pp. 335-348, Aug. 1982.
[6] F. Fabret, H.A. Jacobsen, F. Llirbat, J. Pereira, K.A. Ross, and D. Shasha, “Filtering Algorithms and Implementation for Very Fast Publish/Subscribe Systems,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 115-126, 2001.
[7] C. Faloutsos, “Analytical Results on the Quadtree Decomposition of Arbitrary Rectangles,” Pattern Recognition Letters, vol. 13, no. 1, pp. 31-40, Jan. 1992.
[8] C. Faloutsos, H.V. Jagadish, and Y. Manolopoulos, “Analysis of the n-Dimensional Quadtree Decomposition for Arbitrary Hyperrectangles,” IEEE Trans. Knowledge and Data Eng., vol. 9, no. 3, pp. 373-383 May/June 1997.
[9] V. Gaede and O.G. Günther, “Multidimensional Access Methods,” ACM Computing Surveys, vol. 30, no. 2, pp. 170-231, June 1998.
[10] I. Gargantini, “An Effective Way to Represent Quadtrees,” Comm. ACM, vol. 25, no. 12, pp. 905-910, Dec. 1982.
[11] R.H. Güting, “An Introduction to Spatial Database Systems,” VLDB J., vol. 3, no. 4, pp. 357-399, 1994.
[12] A. Guttman, “R-trees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 47-57 1984.
[13] D.V. Kalashnikov, S. Prabhakar, W.G. Aref, and S.E. Hambrusch, “Efficient Evaluation of Continuous Range Queries on Moving Objects,” Proc. Int'l Conf. Database and Expert Systems Applications, pp. 731-740, 2002.
[14] J.A. Orenstein and F.A. Manola, “Probe Spatial Data Modeling and Query Processing in an Image Database Application,” IEEE Trans. Software Eng., vol. 14, no. 5, pp. 611-629, May 1988.
[15] R. Pajarola, M. Antonijuan, and R. Lario, “QuadTIN: Quadtree Based Triangulated Irregular Networks,” Proc. IEEE Visualization, pp. 395-402, 2002.
[16] G. Proietti, “An Optimal Algorithm for Decomposing a Window into Maximal Quadtree Blocks,” Acta Informatica, vol. 36, no. 4, pp. 257-266, 1999.
[17] H. Samet, Design and Analysis of Spatial Data Structures. Addison-Wesley, 1990.
[18] C.A. Shaffer, “A Formula for Computing the Number of Quadtree Node Fragments Created by a Shift,” Pattern Recognition Letters, vol. 7, no. 1, pp. 45-49, Jan. 1988.
[19] Y.-H. Tsai, K.-L. Chung, and W.-Y. Chen, “A Strip-Splitting-Based Optimal Algorithm for Decomposing a Query Window into Maximal Quadtree Blocks,” IEEE Trans. Knowledge and Data Eng., vol. 16, no. 4, pp. 519-523, Apr. 2004.
[20] T. Tzouramanis, M. Vassilakopoulos, and Y. Manolopoulos, “Overlapping Linear Quadtrees and Spatio-Temporal Query Processing,” Computer J., vol. 43, no. 4, pp. 325-343, 2000.
[21] K.-L. Wu, S.-K. Chen, and P.S. Yu, “Indexing Continual Range Queries for Location-Aware Mobile Services,” Proc. IEEE Int'l Conf. e-Technology, e-Commerce, and e-Services, pp. 233-240, 2004.
[22] K.-L. Wu, S.-K. Chen, and P.S. Yu, “Interval Query Indexing for Efficient Stream Processing,” Proc. ACM 13th Conf. Information and Knowledge Management, pp. 88-97, 2004.

Index Terms:
Quadtree, regular decomposition, geometric data, combinatorial enumeration, binary coding system.
Citation:
Shyh-Kwei Chen, "An Exact Closed-Form Formula for d-Dimensional Quadtree Decomposition of Arbitrary Hyperrectangles," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 6, pp. 784-798, June 2006, doi:10.1109/TKDE.2006.86
Usage of this product signifies your acceptance of the Terms of Use.