{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:25:33Z","timestamp":1725549933604},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291183"},{"type":"electronic","value":"9783540319511"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561071_46","type":"book-chapter","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T12:46:24Z","timestamp":1128602784000},"page":"508-519","source":"Crossref","is-referenced-by-count":0,"title":["Efficient c-Oriented Range Searching with DOP-Trees"],"prefix":"10.1007","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[]},{"given":"Herman","family":"Haverkort","sequence":"additional","affiliation":[]},{"given":"Micha","family":"Streppel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","doi-asserted-by":"crossref","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. Discrete Comput. Geom.\u00a028, 291\u2013312 (2002)","journal-title":"Discrete Comput. Geom."},{"key":"46_CR2","first-page":"1","volume-title":"Advances in Discrete and Computational Geometry, Contemporary Mathematics","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":"46_CR3","doi-asserted-by":"crossref","unstructured":"Gottschalk, S., Lin, M.C., Manocha, D.: OBB-Tree: a hierarchical structure for rapid interference detection. In: Proc. Computer Graphics (SIGGRAPH), pp. 171\u2013180 (1996)","DOI":"10.1145\/237170.237244"},{"key":"46_CR4","unstructured":"Haverkort, H.J.: Results on Geometric Networks and Data Structures. Ph.D. Thesis, Utrecht University (2004)"},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"Haverkort, H.J., de Berg, M., Gudmundsson, J.: Box-Trees for Collision Checking in Industrial Installations. In: Proc. 18th ACM Symp. on Computational Geometry, pp. 53\u201362 (2002)","DOI":"10.1145\/513400.513407"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"Jagadish, H.V.: Spatial Search with Polyhedra. In: Proc. Int. Conf. Data Engineering (ICDE), pp. 311\u2013319 (1990)","DOI":"10.1109\/ICDE.1990.113483"},{"issue":"1","key":"46_CR7","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(1), 21\u201336 (1998)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"46_CR8","volume-title":"Advanced Database Indexing","author":"Y. Manolopoulos","year":"1999","unstructured":"Manolopoulos, Y., Theodoridis, Y., Tsotras, V.: Advanced Database Indexing. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"46_CR9","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF02293051","volume":"8","author":"J. Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J.: Efficient partition trees. Discrete Comput. Geom.\u00a08, 315\u2013334 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"46_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"46_CR11","unstructured":"Sitzmann, I., Stuckey, P.J.: The O-TreeA Constraint-Based Index Structure, technical report, University of Melbourne (1999)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561071_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T05:08:35Z","timestamp":1586495315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561071_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291183","9783540319511"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11561071_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}