
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
ShyhKwei Chen, "An Exact ClosedForm Formula for dDimensional Quadtree Decomposition of Arbitrary Hyperrectangles," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 6, pp. 784798, June, 2006.  
BibTex  x  
@article{ 10.1109/TKDE.2006.86, author = {ShyhKwei Chen}, title = {An Exact ClosedForm Formula for dDimensional Quadtree Decomposition of Arbitrary Hyperrectangles}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {18}, number = {6}, issn = {10414347}, year = {2006}, pages = {784798}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2006.86}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  An Exact ClosedForm Formula for dDimensional Quadtree Decomposition of Arbitrary Hyperrectangles IS  6 SN  10414347 SP784 EP798 EPD  784798 A1  ShyhKwei Chen, PY  2006 KW  Quadtree KW  regular decomposition KW  geometric data KW  combinatorial enumeration KW  binary coding system. VL  18 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] W.G. Aref and H. Samet, “Decomposing a Window into Maximal Quadtree Blocks,” Acta Informatica, vol. 30, pp. 425439, 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. 335348, 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. 115126, 2001.
[7] C. Faloutsos, “Analytical Results on the Quadtree Decomposition of Arbitrary Rectangles,” Pattern Recognition Letters, vol. 13, no. 1, pp. 3140, Jan. 1992.
[8] C. Faloutsos, H.V. Jagadish, and Y. Manolopoulos, “Analysis of the nDimensional Quadtree Decomposition for Arbitrary Hyperrectangles,” IEEE Trans. Knowledge and Data Eng., vol. 9, no. 3, pp. 373383 May/June 1997.
[9] V. Gaede and O.G. Günther, “Multidimensional Access Methods,” ACM Computing Surveys, vol. 30, no. 2, pp. 170231, June 1998.
[10] I. Gargantini, “An Effective Way to Represent Quadtrees,” Comm. ACM, vol. 25, no. 12, pp. 905910, Dec. 1982.
[11] R.H. Güting, “An Introduction to Spatial Database Systems,” VLDB J., vol. 3, no. 4, pp. 357399, 1994.
[12] A. Guttman, “Rtrees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 4757 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. 731740, 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. 611629, May 1988.
[15] R. Pajarola, M. Antonijuan, and R. Lario, “QuadTIN: Quadtree Based Triangulated Irregular Networks,” Proc. IEEE Visualization, pp. 395402, 2002.
[16] G. Proietti, “An Optimal Algorithm for Decomposing a Window into Maximal Quadtree Blocks,” Acta Informatica, vol. 36, no. 4, pp. 257266, 1999.
[17] H. Samet, Design and Analysis of Spatial Data Structures. AddisonWesley, 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. 4549, Jan. 1988.
[19] Y.H. Tsai, K.L. Chung, and W.Y. Chen, “A StripSplittingBased Optimal Algorithm for Decomposing a Query Window into Maximal Quadtree Blocks,” IEEE Trans. Knowledge and Data Eng., vol. 16, no. 4, pp. 519523, Apr. 2004.
[20] T. Tzouramanis, M. Vassilakopoulos, and Y. Manolopoulos, “Overlapping Linear Quadtrees and SpatioTemporal Query Processing,” Computer J., vol. 43, no. 4, pp. 325343, 2000.
[21] K.L. Wu, S.K. Chen, and P.S. Yu, “Indexing Continual Range Queries for LocationAware Mobile Services,” Proc. IEEE Int'l Conf. eTechnology, eCommerce, and eServices, pp. 233240, 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. 8897, 2004.