{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:34:14Z","timestamp":1725701654848},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_6","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T11:29:11Z","timestamp":1346153351000},"page":"48-59","source":"Crossref","is-referenced-by-count":0,"title":["Lower Bounds for Sorted Geometric Queries in the I\/O Model"],"prefix":"10.1007","author":[{"given":"Peyman","family":"Afshani","sequence":"first","affiliation":[]},{"given":"Norbert","family":"Zeh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Afshani, P., Brodal, G., Zeh, N.: Ordered and unordered top-K range reporting in large data sets. In: Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms, pp. 390\u2013400 (2011)","DOI":"10.1137\/1.9781611973082.31"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Afshani, P., Chan, T.M.: Optimal halfspace range reporting in three dimensions. In: Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms, pp. 180\u2013186 (2009)","DOI":"10.1137\/1.9781611973068.21"},{"issue":"9","key":"6_CR3","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Communications of the ACM\u00a031(9), 1116\u20131127 (1988)","journal-title":"Communications of the ACM"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Arge, L., Danner, A., Teh, S.-M.: I\/O-efficient point location using persistent B-trees. In: Proceedings of the 5th Workshop on Algorithm Engineering and Experiments, pp. 82\u201392 (2003)","DOI":"10.1145\/996546.996549"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF01840436","volume":"1","author":"T. Asano","year":"1986","unstructured":"Asano, T., Asano, T., Guibas, L., Hershberger, J., Imai, H.: Visibility of disjoint polygons. Algorithmica\u00a01, 49\u201363 (1986)","journal-title":"Algorithmica"},{"issue":"3","key":"6_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 Journal on Computin\u00a015(3), 703\u2013724 (1986)","journal-title":"SIAM Journal on Computin"},{"issue":"1-3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0012-365X(92)90658-3","volume":"108","author":"J. Gil","year":"1992","unstructured":"Gil, J., Steiger, W., Wigderson, A.: Geometric medians. Discrete Mathematics\u00a0108(1-3), 37\u201351 (1992)","journal-title":"Discrete Mathematics"},{"issue":"4","key":"6_CR8","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"R. Graham","year":"1972","unstructured":"Graham, R.: An efficient algorith for determining the convex hull of a finite planar set. Information Processing Letters\u00a01(4), 132\u2013133 (1972)","journal-title":"Information Processing Letters"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Kaplan, H.: Persistent data structures. In: Handbook on Data Structures and Applications. CRC Press (2005)","DOI":"10.1201\/9781420035179.ch31"},{"issue":"6","key":"6_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0020-0190(90)90217-L","volume":"33","author":"S. Khuller","year":"1990","unstructured":"Khuller, S., Mitchell, J.S.B.: On a triangle counting problem. Information Processing Letters\u00a033(6), 319\u2013321 (1990)","journal-title":"Information Processing Letters"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Springer (2002)","DOI":"10.1007\/978-1-4613-0039-7"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-02270-8_14","volume-title":"Frontiers in Algorithmics","author":"M. Nouri","year":"2009","unstructured":"Nouri, M., Ghodsi, M.: Space\u2013Query-Time Tradeoff for Computing the Visibility Polygon. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) FAW 2009. LNCS, vol.\u00a05598, pp. 120\u2013131. Springer, Heidelberg (2009)"},{"issue":"4","key":"6_CR13","doi-asserted-by":"publisher","first-page":"516","DOI":"10.2307\/2986073","volume":"45","author":"P.J. Rousseeuw","year":"1996","unstructured":"Rousseeuw, P.J., Ruts, I.: Bivariate location depth. Journal of Applied Statistics\u00a045(4), 516\u2013526 (1996)","journal-title":"Journal of Applied Statistics"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Suri, S., O\u2019Rourke, J.: Worst-case optimal algorithms for constructing visibility polygons with holes. In: Proceedings of the 2nd ACM Symposium on Computational Geometry, pp. 14\u201323. ACM (1986)","DOI":"10.1145\/10515.10517"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T14:07:14Z","timestamp":1643292434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}