Abstract
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical space decomposition structures that are general-purpose and space-efficient, and, in addition, enjoy a worst case performance poly-logarithmic in the number of points for approximate queries. They maintain limits on their depth, as well as on the aspect ratio (intuitively, how skinny the regions can be). BAR trees were initially developed for 2 dimensional spaces and a fixed set of partitioning planes, and then extended to d dimensional spaces and more general partitioning planes. Here we revisit 2 dimensional spaces and show that, for any given set of 3 partitioning planes, it is not only possible to construct such trees, it is also possible to derive a simple closed-form upper bound on the aspect ratio. This bound, and the resulting algorithm, are much simpler than what is known for general BAR trees. We call the resulting BAR trees Parameterized BAR trees and empirically evaluate them for different partitioning planes. Our experiments show that our theoretical bound converges to the empirically obtained values in the lower ranges, and also make a case for using evenly oriented partitioning planes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.: An optimal algorithm for approximate nearest neighbor searching. In: Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, pp. 573–582 (1994)
Arya, S., Mount, D.M.: Approximate range searching. In: Proc. 11th Annu. ACM Sympos. Comput. Geom., pp. 172–181 (1995)
Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509–517 (1975)
Bentley, J.L.: Multidimensional binary search trees in database applications. IEEE Trans. Softw. Eng. SE-5, 333–340 (1979)
Bentley, J.L.: K-d trees for semidynamic point sets. In: Proc. 6th Annu. ACM Sympos. Comput. Geom., pp. 187–197 (1990)
Callahan, P.B., Kosaraju, S.R.: A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM 42, 67–90 (1995)
Callahan, P.B., Kosaraju, S.R.: Algorithms for dynamic closest-pair and n-body potential fields. In: Proc. 6th ACM-SIAM Sympos. Discrete Algorithms, pp. 263–272 (1995)
Chaudhary, A., Goodrich, M.T.: Balanced aspect ratio trees revisited. Full version of the paper, http://www.cse.nd.edu/~achaudha/research
Dickerson, M., Duncan, C.A., Goodrich, M.T.: K-D trees are better when cut on the longest side. In: Paterson, M. (ed.) ESA 2000. LNCS, vol. 1879, pp. 179–190. Springer, Heidelberg (2000)
Duncan, C.: Balanced Aspect Ratio Trees. PhD thesis, The Johns Hopkins University, Baltimore, Maryland (September 1999)
Duncan, C.A., Goodrich, M.T., Kobourov, S.: Balanced aspect ratio trees: combining the advantages of k-d trees and octrees. In: Proc. 10th Annu. ACM-SIAM Sympos. Discrete Alg., pp. 300–309 (1999)
Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Balanced aspect ratio trees and their use for drawing very large graphs. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 111–124. Springer, Heidelberg (1999)
Fuchs, H., Abrams, G.D., Grant, E.D.: Near real-time shaded display of rigid objects. Comput. Graph. 17(3), 65–72 (1983); Proc. SIGGRAPH 1983 (1983)
Fuchs, H., Kedem, Z.M., Naylor, B.: On visible surface generation by a priori tree structures. Comput. Graph. 14(3), 124–133 (1980); Proc. SIGGRAPH 1980 (1980)
Luebke, D., Erikson, C.: View-dependent simplification of arbitrary polygonal environments. In: Whitted, T. (ed.) SIGGRAPH 1997 Conference Proceedings, ACM SIGGRAPH. Annual Conference Series, pp. 199–208. Addison Wesley, Reading (1997), ISBN 0-89791-896-7
Lupton, R., Maley, F.M., Young, N.: Sloan digital sky survey, http://www.sdss.org/sdss.html
Lupton, R., Maley, F.M., Young, N.: Data collection for the Sloan Digital Sky Survey—A network-flow heuristic. Journal of Algorithms 27(2), 339–356 (1998)
Samet, H.: Spatial Data Structures: Quadtrees, Octrees, and Other Hierarchical Methods. Addison-Wesley, Reading (1989)
Samet, H.: Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chaudhary, A., Goodrich, M.T. (2005). Balanced Aspect Ratio Trees Revisited. In: Dehne, F., López-Ortiz, A., Sack, JR. (eds) Algorithms and Data Structures. WADS 2005. Lecture Notes in Computer Science, vol 3608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534273_8
Download citation
DOI: https://doi.org/10.1007/11534273_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28101-6
Online ISBN: 978-3-540-31711-1
eBook Packages: Computer ScienceComputer Science (R0)