{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:40:28Z","timestamp":1725532828691},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020100"},{"type":"electronic","value":"9783642020117"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02011-7_8","type":"book-chapter","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T05:12:20Z","timestamp":1243919540000},"page":"63-75","source":"Crossref","is-referenced-by-count":0,"title":["Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy"],"prefix":"10.1007","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[]},{"given":"Peter","family":"Hachenberger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","volume-title":"CRC Handbook of Discrete and Computational Geometry","author":"P.K. Agarwal","year":"2004","unstructured":"Agarwal, P.K.: Range searching. In: Goodman, J., \u2018O\u2019Rourke, J. (eds.) CRC Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton (2004)"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s00454-002-2817-1","volume":"28","author":"P.K. Agarwal","year":"2002","unstructured":"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.\u00a028, 291\u2013312 (2002)","journal-title":"Discr. Comput. Geom."},{"key":"8_CR3","series-title":"Contemporary Mathematics","first-page":"1","volume-title":"Advances in Discrete and Computational Geometry","author":"P.K. Agarwal","year":"1998","unstructured":"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.\u00a0223, pp. 1\u201356. American Mathematical Society, Providence (1998)"},{"key":"8_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008)","edition":"3"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.comgeo.2008.05.002","volume":"42","author":"M. Berg de","year":"2009","unstructured":"de Berg, M., Haverkort, H.J., Streppel, M.: Efficient c-oriented range searching with DOP-trees. Comput. Geom. Theory Appl.\u00a042, 250\u2013267 (2009)","journal-title":"Comput. Geom. Theory Appl."},{"unstructured":"F\u00fcnfzig, C., Fellner, D.W.: Easy realignment of k-DOP bounding volumes. In: Graphics Interface, pp. 257\u2013264 (2003)","key":"8_CR6"},{"doi-asserted-by":"crossref","unstructured":"Gottschalk, S., Lin, M.C., Manocha, D.: OBB-Tree: a hierarchical structure for rapid interference detection. In: Proc. SIGGRAPH 1996, pp. 171\u2013180 (1996)","key":"8_CR7","DOI":"10.1145\/237170.237244"},{"unstructured":"Haverkort, H.J.: Results on Geometric Networks and Data Structures. Ph.D. Thesis, Utrecht University (2004)","key":"8_CR8"},{"doi-asserted-by":"crossref","unstructured":"Jagadish, H.V.: Spatial search with polyhedra. In: Proc. Int. Conf. Data Engineering (ICDE), pp. 311\u2013319 (1990)","key":"8_CR9","DOI":"10.1109\/ICDE.1990.113483"},{"doi-asserted-by":"crossref","unstructured":"Kay, T.: Ray tracing complex scenes. In: Proc. SIGGRAPH 1986, pp. 269\u2013278 (1986)","key":"8_CR10","DOI":"10.1145\/15922.15916"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/2945.675649","volume":"4","author":"J.T. Klosowski","year":"1998","unstructured":"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\u00a04, 21\u201336 (1998)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-63818-0_6","volume-title":"Algorithmic Foundations of Geographic Information Systems","author":"J. Nievergelt","year":"1997","unstructured":"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.\u00a01340, pp. 153\u2013197. Springer, Heidelberg (1997)"},{"unstructured":"Streppel, M.: Multifunctional Geometric Data Structures. Ph.D thesis, TU Eindhoven (2007)","key":"8_CR13"},{"unstructured":"Sitzmann, I., Stuckey, P.J.: The O-Tree \u2013 A Constraint-Based Index Structure. Technical report, University of Melbourne (1999)","key":"8_CR14"},{"doi-asserted-by":"crossref","unstructured":"Zachmann, G.: Rapid collision detection by dynamically aligned DOP-trees. In: Proc. of IEEE Virtual Reality Annual International Symposium, pp. 90\u201397 (1998)","key":"8_CR15","DOI":"10.1109\/VRAIS.1998.658428"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02011-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:55:18Z","timestamp":1558349718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02011-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020100","9783642020117"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02011-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}