{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:11:03Z","timestamp":1725567063781},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_55","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:34:13Z","timestamp":1127828053000},"page":"544-553","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Non-intersection Queries on Aggregated Geometric Data"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Janardan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"55_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/3-540-45749-6_31","volume-title":"Algorithms - ESA 2002","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., Govindarajan, S., Muthukrishnan, S.: Range Searching in categorical data: colored range searching on grid-trees. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 323\u2013334. Springer, Heidelberg (2002)"},{"issue":"6","key":"55_CR2","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/BF01940884","volume":"15","author":"P.K. Agarwal","year":"1996","unstructured":"Agarwal, P.K., van Kreveld, M.: Connected component and simple polygon intersection searching. Algorithmica\u00a015(6), 626\u2013660 (1996)","journal-title":"Algorithmica"},{"key":"55_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/3-540-60084-1_97","volume-title":"Automata, Languages and Programming","author":"P. Bozanis","year":"1995","unstructured":"Bozanis, P., Kitsios, N., Makris, C., Tsakalidis, A.: New upper bounds for generalized intersection searching problems. In: F\u00fcl\u00f6p, Z., Gecseg, F. (eds.) ICALP 1995. LNCS, vol.\u00a0944, pp. 464\u2013475. Springer, Heidelberg (1995)"},{"issue":"6","key":"55_CR4","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1093\/comjnl\/39.6.541","volume":"39","author":"P. Bozanis","year":"1996","unstructured":"Bozanis, P., Kitsios, N., Makris, C., Tsakalidis, A.: Red-Blue intersection reporting for objects of non-constant size. The Computer J.\u00a039(6), 541\u2013546 (1996)","journal-title":"The Computer J."},{"issue":"1","key":"55_CR5","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1093\/comjnl\/40.1.22","volume":"40","author":"P. Bozanis","year":"1997","unstructured":"Bozanis, P., Kitsios, N., Makris, C., Tsakalidis, A.: New results on intersection query problems. The Computer J.\u00a040(1), 22\u201329 (1997)","journal-title":"The Computer J."},{"issue":"3","key":"55_CR6","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/0215051","volume":"15","author":"B. Chazelle","year":"1986","unstructured":"Chazelle, B.: Filtering search: A new approach to query-answering. SIAM J. Computing\u00a015(3), 703\u2013724 (1986)","journal-title":"SIAM J. Computing"},{"key":"55_CR7","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"J.R. Driscoll","year":"1989","unstructured":"Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. J. Computer and System Sciences\u00a038, 86\u2013124 (1989)","journal-title":"J. Computer and System Sciences"},{"key":"55_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer, Heidelberg (1987)"},{"key":"55_CR9","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1006\/jagm.1995.1038","volume":"19","author":"P. Gupta","year":"1995","unstructured":"Gupta, P., Janardan, R., Smid, M.: Further results on generalized intersection searching problems: counting, reporting, and dynamization. J. Algorithms\u00a019, 282\u2013317 (1995)","journal-title":"J. Algorithms"},{"key":"55_CR10","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0925-7721(94)00019-0","volume":"5","author":"P. Gupta","year":"1996","unstructured":"Gupta, P., Janardan, R., Smid, M.: Algorithms for generalized halfspace range searching and other intersection searching problems. Computational Geometry: Theory and Applications\u00a05, 321\u2013340 (1996)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"55_CR11","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0020-0190(97)00183-X","volume":"64","author":"P. Gupta","year":"1997","unstructured":"Gupta, P., Janardan, R., Smid, M.: A technique for adding range restrictions to generalized searching problems. Information Processing Letters\u00a064, 263\u2013269 (1997)","journal-title":"Information Processing Letters"},{"key":"55_CR12","first-page":"35","volume":"1","author":"P. Gupta","year":"1999","unstructured":"Gupta, P., Janardan, R., Smid, M.: Algorithms for some intersection searching problems involving circular objects. Intl. J. Math. Algorithms\u00a01, 35\u201352 (1999)","journal-title":"Intl. J. Math. Algorithms"},{"key":"55_CR13","first-page":"1","volume-title":"Handbook of Data Structures, ch. 64","author":"P. Gupta","year":"2004","unstructured":"Gupta, P., Janardan, R., Smid, M.: Computational Geometry: Generalized Intersection Searching. In: Sahni, S., Mehta, D. (eds.) Handbook of Data Structures, ch. 64, pp. 1\u201317. CRC Press, Boca Raton (2004)"},{"key":"55_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1142\/S021819599300004X","volume":"3","author":"R. Janardan","year":"1993","unstructured":"Janardan, R., Lopez, M.: Generalized intersection searching problems. Intl. J. Computational Geometry & Applications\u00a03, 39\u201369 (1993)","journal-title":"Intl. J. Computational Geometry & Applications"},{"key":"55_CR15","unstructured":"Information culled from the Investment Company Institute\u2019s Mutual Fund Factbook (2003), \n                    \n                      www.ici.org\n                    \n                    \n                   and Yahoo.com \n                    \n                      finance.yahoo.com"},{"issue":"2","key":"55_CR16","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"E.M. McCreight","year":"1985","unstructured":"McCreight, E.M.: Priority search trees. SIAM J. Computing\u00a014(2), 257\u2013276 (1985)","journal-title":"SIAM J. Computing"},{"key":"55_CR17","unstructured":"Muthukrishnan, S.: Efficient algorithms for document retrieval problems. In: Proc. 13th Annual Symp. on Discrete Algorithms, pp. 657\u2013666 (2002)"},{"key":"55_CR18","unstructured":"Shi, Q., JaJa, J.: Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines. Technical Report CS\u2013TR\u20134542, UMIACS Univ. of Maryland, College Park, MD (2003)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T07:33:44Z","timestamp":1553153624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11533719_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}