{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:40Z","timestamp":1725664960902},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540606185"},{"type":"electronic","value":"9783540484875"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60618-1_65","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:49:27Z","timestamp":1330289367000},"page":"49-61","source":"Crossref","is-referenced-by-count":0,"title":["Incremental hive graph"],"prefix":"10.1007","author":[{"given":"Fabrizio","family":"d'Amore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Giaccio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","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. Comput., 15:703\u2013724, 1986.","journal-title":"SIAM J. Comput."},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02187875","volume":"2","author":"B. Chazelle","year":"1987","unstructured":"B. Chazelle and H. Edelsbrunner. Linear space data structures for two types of range search. Discrete Comput. Geom., 2:113\u2013126, 1987.","journal-title":"Discrete Comput. Geom."},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1137\/0221057","volume":"21","author":"S. W. Cheng","year":"1992","unstructured":"S. W. Cheng and R. Janardan. New results on dynamic planar point location. SIAM J. Comput., 21:972\u2013999, 1992.","journal-title":"SIAM J. Comput."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Y.-J. Chiang and R. Tamassia. Dynamization of the trapezoid method for planar point location. In Proc. 7th Annual ACM Symp. on Computational Geometry, pages 61\u201370, 1991.","DOI":"10.1145\/109648.109655"},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/BF01840399","volume":"5","author":"Y.-T. Lai","year":"1990","unstructured":"Y.-T. Lai and S. M. Leinwand. A theory of rectangular dual graphs. Algorithmica, 5:467\u2013483, 1990.","journal-title":"Algorithmica"},{"key":"5_CR6","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\u00c4her. Bounded ordered dictionaries in O(log log n) time and O(n) space. Inform. Process. Lett., 35:183\u2013189, 1990.","journal-title":"Inform. Process. Lett."},{"key":"5_CR7","unstructured":"D. Mullis. Reporting overlaps in a dynamic interval set by filtering search. In Proc. 4th Canad. Conf. Comput. Geom., pages 160\u2013169, 1992."},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(90)90007-5","volume":"74","author":"F. P. Preparata","year":"1990","unstructured":"F. P. Preparata and R. Tamassia. Dynamic planar point location with optimal query time. Theoret. Comput. Sci., 74:95\u2013114, 1990.","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR9","volume-title":"The Design and Analysis of Spatial Data Structures","author":"H. Samet","year":"1990","unstructured":"H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990."},{"issue":"7","key":"5_CR10","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1145\/6138.6151","volume":"29","author":"N. Sarnak","year":"1986","unstructured":"N. Sarnak and E. Tarjan. Planar point location using persistent search trees. CACM, 29(7):669\u2013679, July 1986.","journal-title":"CACM"},{"key":"5_CR11","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0020-0190(91)90138-8","volume":"37","author":"R. Tamassia","year":"1991","unstructured":"R. Tamassia. An incremental reconstruction method for dynamic planar point location. Inform. Process. Lett., 37:79\u201383, 1991.","journal-title":"Inform. Process. Lett."},{"key":"5_CR12","series-title":"Database Systems and Applications Series","volume-title":"Temporal Databases: Theory, Design, and Implementation","year":"1993","unstructured":"A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors. Temporal Databases: Theory, Design, and Implementation. Database Systems and Applications Series. Benjamin\/Cummings, Redwood City, CA, 1993."},{"key":"5_CR13","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas van","year":"1977","unstructured":"P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Inform. Process. Lett., 6:80\u201382, 1977.","journal-title":"Inform. Process. Lett."},{"key":"5_CR14","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 O(n). Inform. Process. Lett., 17:81\u201389, 1983.","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60618-1_65.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:00:51Z","timestamp":1605646851000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60618-1_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540606185","9783540484875"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-60618-1_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}