{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:46:22Z","timestamp":1770993982718,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540600848","type":"print"},{"value":"9783540494256","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60084-1_97","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:39:14Z","timestamp":1330277954000},"page":"464-474","source":"Crossref","is-referenced-by-count":14,"title":["New upper bounds for generalized intersection searching problems"],"prefix":"10.1007","author":[{"given":"Panayiotis","family":"Bozanis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nectarios","family":"Kitsios","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Makris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athanasios","family":"Tsakalidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"issue":"3","key":"40_CR1","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1137\/0217026","volume":"17","author":"B. Chazelle","year":"1988","unstructured":"B. Chazelle. A functional approach to data structures and its use in multidimensional searching. SIAM Journal on Computing 17, 3,427\u2013462 (1988)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"40_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/147508.147511","volume":"39","author":"B. Chazelle","year":"1994","unstructured":"B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane. Journal of the ACM, 39,1,1\u201354 (1994)","journal-title":"Journal of the ACM"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"B. Chazelle, L. Guibas, and D. T. Lee. The Power of Duality. In: Proceedings of the 24th IEEE Annual Symposium on Foundations of Computer Science, 1983, pp. 217\u2013225.","DOI":"10.1109\/SFCS.1983.75"},{"key":"40_CR4","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0019-9958(84)80040-6","volume":"63","author":"R. Cole","year":"1984","unstructured":"R. Cole, C. K. Yap. Geometric Retrieval Problems. Information and Control 63, 39\u201357 (1984)","journal-title":"Information and Control"},{"key":"40_CR5","doi-asserted-by":"crossref","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":"40_CR6","doi-asserted-by":"crossref","unstructured":"P. Gupta, R. Janardan, and M. Smid. Further results on generalized intersection searching problems: counting, reporting, and dynamization. In: Proceedings of the 1993 Workshop on Algorithms and Data Structures. August 1993, pp. 361\u2013372.","DOI":"10.1007\/3-540-57155-8_262"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"P. Gupta, R. Janardan, and M. Smid. Efficient Algorithms for Generalized Intersection Searching on Non-Iso-oriented Objects. In: Proceedings of the 10th ACM Symposium on Computational Geometry. 1994, pp. 369\u2013377","DOI":"10.1145\/177424.178096"},{"key":"40_CR8","first-page":"64","volume-title":"Lecture Notes in Computer Science 318","author":"L. Guibas","year":"1988","unstructured":"L. Guibas, M. Overmars, and M. Sharir. Intersecting line segments, ray shooting and other applications of geometric partitioning techniques. In: Proceedings SWAT '88. Lecture Notes in Computer Science 318: Springer Verlag, Berlin: 1988, pp. 64\u201373"},{"key":"40_CR9","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1142\/S021819599300004X","volume":"3","author":"R. Janardan","year":"1993","unstructured":"R. Janardan, M. Lopez. Generalized intersection searching problems. International Journal of Computational Geometry and Applications 3, 39\u201369 (1993)","journal-title":"International Journal of Computational Geometry and Applications"},{"issue":"1","key":"40_CR10","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D. Kirkpatrick","year":"1993","unstructured":"D. Kirkpatrick. Optimal search in planar subdivisions. SIAM Journal on Computing 12, 1, 28\u201335 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"40_CR11","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/0196-6774(86)90033-7","volume":"7","author":"M.S. Paterson","year":"1986","unstructured":"M.S. Paterson, F.F. Yao. Point retrieval for polygons. Journal of Algorithms 7, 441\u2013447(1986)","journal-title":"Journal of Algorithms"},{"key":"40_CR12","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1145\/6138.6151","volume":"29","author":"N. Sarnak","year":"1986","unstructured":"N. Sarnak, R. E. Tarjan. Planar point location using persistent search trees. Communications of the ACM 29,669\u2013679(1986)","journal-title":"Communications of the ACM"},{"key":"40_CR13","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1145\/3828.3839","volume":"32","author":"D. E. Willard","year":"1985","unstructured":"D. E. Willard, 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","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60084-1_97.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:52:14Z","timestamp":1742597534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60084-1_97"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600848","9783540494256"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-60084-1_97","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}