{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:48Z","timestamp":1725663768459},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_262","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:05:53Z","timestamp":1330257953000},"page":"361-372","source":"Crossref","is-referenced-by-count":6,"title":["Further results on generalized intersection searching problems: Counting, reporting, and dynamization"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Ravi","family":"Janardan","sequence":"additional","affiliation":[]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"34_CR1","unstructured":"P.K. Agarwal and M. van Kreveld. Connected component and simple polygon intersection searching. This Proceedings."},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/0215051","volume":"15","author":"B.M. Chazelle","year":"1986","unstructured":"B.M. Chazelle. Filtering search: a new approach to query-answering. SIAM Journal on Computing, 15:703\u2013724, 1986.","journal-title":"SIAM Journal on Computing"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0020-0190(90)90151-M","volume":"36","author":"S.W. Cheng","year":"1990","unstructured":"S.W. Cheng and R. Janardan. Efficient dynamic algorithms for some geometric intersection problems. Information Processing Letters, 36:251\u2013258, 1990.","journal-title":"Information Processing Letters"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"J.R. Driscoll","year":"1989","unstructured":"J.R. Driscoll, N. Sarnak, D.D. Sleator, and R.E. Tarjan. Making data structures persistent. Journal of Computer and System Sciences, 38:86\u2013124, 1989.","journal-title":"Journal of Computer and System Sciences"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"P. Gupta, R. Janardan, and M. Smid. Further results on generalized intersection searching problems: counting, reporting, and dynamization. Technical Report TR-92-72, Dept. of Computer Science, University of Minnesota, 1992. Submitted.","DOI":"10.1007\/3-540-57155-8_262"},{"key":"34_CR6","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1142\/S021819599300004X","volume":"3","author":"R. Janardan","year":"1993","unstructured":"R. Janardan and M. Lopez. Generalized intersection searching problems. International Journal of Computational Geometry & Applications, 3:39\u201369, 1993.","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"34_CR7","volume-title":"PhD thesis","author":"M. Lopez","year":"1991","unstructured":"M. Lopez. Algorithms for composite geometric objects. PhD thesis, Department of Computer Science, University of Minnesota, Minneapolis, Minnesota, 1991."},{"key":"34_CR8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"E.M. McCreight","year":"1985","unstructured":"E.M. McCreight. Priority search trees. SIAM Journal on Computing, 14:257\u2013276, 1985.","journal-title":"SIAM Journal on Computing"},{"key":"34_CR9","unstructured":"F.P. Preparata and M.I. Shamos. Computational Geometry \u2014 An Introduction. Springer-Verlag, 1988."},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1145\/3828.3839","volume":"32","author":"D.E. Willard","year":"1985","unstructured":"D.E. Willard and G.S. Lueker. Adding range restriction capability to dynamic data structures. Journal of the ACM, 32:597\u2013617, 1985.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_262.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:19Z","timestamp":1605647299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_262","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}