Abstract
We introduce a new type of bounding-volume hierarchy, the c-oriented rotated-box tree, or c-rb-tree for short. A c-rb-tree uses boxes as bounding volumes, whose orientations come from a fixed set of predefined box orientations. We theoretically and experimentally compare our new c-rb-tree to two existing bounding-volumes hierarchies, namely c-dop-tree and box-trees.
Both authors were supported by the Netherlands’ Organisation for Scientific Research (NWO) under project no. 639.023.301. P.H. was also supported in part by a NABIIT grant from the Danish Strategic Research Council and by the Danish National Research Foundation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agarwal, P.K.: Range searching. In: Goodman, J., ‘O’Rourke, J. (eds.) CRC Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton (2004)
Agarwal, P.K., de Berg, M., Gudmundsson, J., Hammar, M., Haverkort, H.J.: Box-trees and R-trees with near-optimal query time. Discr. Comput. Geom. 28, 291–312 (2002)
Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J., Pollack, R. (eds.) Advances in Discrete and Computational Geometry. Contemporary Mathematics, vol. 223, pp. 1–56. American Mathematical Society, Providence (1998)
de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008)
de Berg, M., Haverkort, H.J., Streppel, M.: Efficient c-oriented range searching with DOP-trees. Comput. Geom. Theory Appl. 42, 250–267 (2009)
Fünfzig, C., Fellner, D.W.: Easy realignment of k-DOP bounding volumes. In: Graphics Interface, pp. 257–264 (2003)
Gottschalk, S., Lin, M.C., Manocha, D.: OBB-Tree: a hierarchical structure for rapid interference detection. In: Proc. SIGGRAPH 1996, pp. 171–180 (1996)
Haverkort, H.J.: Results on Geometric Networks and Data Structures. Ph.D. Thesis, Utrecht University (2004)
Jagadish, H.V.: Spatial search with polyhedra. In: Proc. Int. Conf. Data Engineering (ICDE), pp. 311–319 (1990)
Kay, T.: Ray tracing complex scenes. In: Proc. SIGGRAPH 1986, pp. 269–278 (1986)
Klosowski, J.T., Held, M., Mitchell, J.S.B., Sowizral, H., Zikan, K.: Efficient collision detection using bounding volume hierarchies of k-DOPs. IEEE Transactions on Visualization and Computer Graphics 4, 21–36 (1998)
Nievergelt, J., Widmayer, P.: Spatial data structures: concepts and design choices. In: van Kreveld, M., Nievergelt, J., Roos, T., Widmayer, P. (eds.) CISM School 1996. LNCS, vol. 1340, pp. 153–197. Springer, Heidelberg (1997)
Streppel, M.: Multifunctional Geometric Data Structures. Ph.D thesis, TU Eindhoven (2007)
Sitzmann, I., Stuckey, P.J.: The O-Tree – A Constraint-Based Index Structure. Technical report, University of Melbourne (1999)
Zachmann, G.: Rapid collision detection by dynamically aligned DOP-trees. In: Proc. of IEEE Virtual Reality Annual International Symposium, pp. 90–97 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Berg, M., Hachenberger, P. (2009). Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy . In: Vahrenhold, J. (eds) Experimental Algorithms. SEA 2009. Lecture Notes in Computer Science, vol 5526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02011-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-02011-7_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02010-0
Online ISBN: 978-3-642-02011-7
eBook Packages: Computer ScienceComputer Science (R0)