{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:46Z","timestamp":1725663706470},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540557067"},{"type":"electronic","value":"9783540472759"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55706-7_32","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T05:33:20Z","timestamp":1330234400000},"page":"352-363","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Two- and three- dimensional point location in rectangular subdivisions"],"prefix":"10.1007","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[]},{"given":"Marc","family":"van Kreveld","sequence":"additional","affiliation":[]},{"given":"Jack","family":"Snoeyink","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"H. Alt, R. Fleischer, M. Kaufmann, K. Mehlhorn, S. N\u00e4her, S. Schirra, and C. Uhrig. Approximate motion planning and the complexity of the boundary of the union of simple geometric figures. In Proc. 6th Ann. ACM Symp. Comp. Geom., pages 281\u2013289, 1990.","DOI":"10.1145\/98524.98592"},{"issue":"3","key":"32_CR2","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0215051","volume":"15","author":"B. Chazelle","year":"1986","unstructured":"B. Chazelle. Filtering search: A new approach to query-answering. SIAM J. Comp., 15(3):703\u2013723, 1986.","journal-title":"SIAM J. Comp."},{"key":"32_CR3","first-page":"524","volume-title":"Proc. 29th FOCS","author":"M. Dietzfelbinger","year":"1988","unstructured":"M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. In Proc. 29th FOCS, pages 524\u2013531, 1988. Revised version: Bericht Nr. 77, Reihe Informatik, Paderborn, Januar 91."},{"key":"32_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin, 1987."},{"key":"32_CR5","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1093\/comjnl\/29.1.76","volume":"29","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner, G. Haring, and D. Hilbert. Rectangular point location in d dimensions with applications. Computer Journal, 29:76\u201382, 1986.","journal-title":"Computer Journal"},{"key":"32_CR6","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0304-3975(81)90103-1","volume":"16","author":"H. Edelsbrunner","year":"1981","unstructured":"H. Edelsbrunner and H. A. Maurer. A space-optimal solution of general region location. Theoretical Comp. Sci., 16:329\u2013336, 1981.","journal-title":"Theoretical Comp. Sci."},{"issue":"3","key":"32_CR7","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M. L. Fredman","year":"1984","unstructured":"M. L. Fredman, J. Koml\u00f3s, and E. Szemer\u00e9di. Storing a sparse table with O(1) worst case access time. JACM, 31(3):538\u2013544, 1984.","journal-title":"JACM"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"M. T. Goodrich and R. Tamassia. Dynamic trees and dynamic point location. In Proc. 23rd Ann. ACM STOC, pages 523\u2013533, 1991.","DOI":"10.1145\/103418.103472"},{"key":"32_CR9","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01786986","volume":"15","author":"D. Johnson","year":"1982","unstructured":"D. Johnson. A priority queue in which initialization and queue operations take O(log log D) time. Math. Systems Theory, 15:295\u2013309, 1982.","journal-title":"Math. Systems Theory"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"R. J. Lipton and R. E. Tarjan. Applications of a planar separator theorem. In Proc. 18th FOCS, pages 162\u2013170, 1977.","DOI":"10.1109\/SFCS.1977.6"},{"key":"32_CR11","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(90)90022-P","volume":"35","author":"K. Mehlhorn","year":"1990","unstructured":"K. Mehlhorn and S. N\u00e4her. Bounded ordered dictionaries in O(log log N) time and O(n) space. Info. Proc. Let, 35:183\u2013189, 1990.","journal-title":"Info. Proc. Let"},{"key":"32_CR12","unstructured":"H. M\u00fcller. Rasterized point location. In H. Noltemeier, editor, Proc. WG 85, pages 281\u2013294. Trauner Verlag, 1985."},{"issue":"1","key":"32_CR13","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1142\/S0129054190000072","volume":"1","author":"F. P. Preparata","year":"1990","unstructured":"F. P. Preparata. Planar point location revisited. Int. J. Found. Comp. Sci., 1(1):71\u201386, 1990.","journal-title":"Int. J. Found. Comp. Sci."},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"P. van Emde Boas. Preserving order in a forest in less than logarithmic time. In Proc. 16th FOCS, pages 75\u201384, 1976.","DOI":"10.1109\/SFCS.1975.26"},{"key":"32_CR15","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. v. E. Boas","year":"1977","unstructured":"P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Info. Proc. Let, 6:80\u201382, 1977.","journal-title":"Info. Proc. Let"},{"key":"32_CR16","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01683268","volume":"10","author":"P. Emde Boas van","year":"1977","unstructured":"P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Math. Systems Theory, 10:99\u2013127, 1977.","journal-title":"Math. Systems Theory"},{"key":"32_CR17","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0020-0190(83)90075-3","volume":"17","author":"D. E. Willard","year":"1983","unstructured":"D. E. Willard. Log-logarithmic worst-case range queries are possible in space \u0398(N). Info. Proc. Let, 17:81\u201389, 1983.","journal-title":"Info. Proc. Let"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55706-7_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:31:31Z","timestamp":1578508291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55706-7_32"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540557067","9783540472759"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-55706-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}