{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:43:39Z","timestamp":1725489819889},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540739487"},{"type":"electronic","value":"9783540739517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73951-7_2","type":"book-chapter","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T10:18:03Z","timestamp":1187605083000},"page":"2-14","source":"Crossref","is-referenced-by-count":5,"title":["Approximate Range Searching: The Absolute Model"],"prefix":"10.1007","author":[{"given":"Guilherme D.","family":"da Fonseca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","first-page":"1","volume-title":"Advances in Discrete and Computational Geometry","author":"P.K. Agarwal","year":"1998","unstructured":"Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J., Pollack, R. (eds.) Advances in Discrete and Computational Geometry, pp. 1\u201356. American Mathematical Society, Providence, RI (1998)"},{"key":"2_CR2","volume-title":"Combinatorial and Computational Geometry","author":"P.K. Agarwal","year":"2005","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Geometric approximation via coresets. In: Goodman, J.E., Pach, J., Welzl, E. (eds.) Combinatorial and Computational Geometry, MSRI Publications\/Cambridge Univ. Press, Cambridge (2005)"},{"key":"2_CR3","first-page":"535","volume-title":"SODA 2005","author":"S. Arya","year":"2005","unstructured":"Arya, S., Malamatos, T., Mount, D.M.: Space-time tradeoffs for approximate spherical range counting. In: SODA 2005. 16th Ann. ACM-SIAM Symposium on Discrete Algorithms, pp. 535\u2013544. ACM Press, New York (2005)"},{"key":"2_CR4","first-page":"11","volume-title":"SoCG 2006","author":"S. Arya","year":"2006","unstructured":"Arya, S., Malamatos, T., Mount, D.M.: The effect of corners on the complexity of approximate range searching. In: SoCG 2006. Proceedings of the 22nd ACM Symp. on Computational Geometry, pp. 11\u201320. ACM Press, New York (2006)"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1145\/1132516.1132598","volume-title":"STOC 2006","author":"S. Arya","year":"2006","unstructured":"Arya, S., Malamatos, T., Mount, D.M.: On the importance of idempotence. In: STOC 2006. Proc. 38th ACM Symp. on Theory of Computing, pp. 564\u2013573. ACM Press, New York (2006)"},{"issue":"3-4","key":"2_CR6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0925-7721(00)00022-5","volume":"17","author":"S. Arya","year":"2000","unstructured":"Arya, S., Mount, D.M.: Approximate range searching. Comput. Geom. Theory Appl.\u00a017(3-4), 135\u2013152 (2000)","journal-title":"Comput. Geom. Theory Appl."},{"key":"2_CR7","first-page":"1","volume-title":"Proc. ACM Princ. Database Systems","author":"B. Babcock","year":"2002","unstructured":"Babcock, B., Babu, S., Data, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: Proc. ACM Princ. Database Systems, pp. 1\u201316. ACM Press, New York (2002)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwartzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (2000)","DOI":"10.1007\/978-3-662-04245-8"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF02573971","volume":"10","author":"H. Br\u00f6nnimann","year":"1993","unstructured":"Br\u00f6nnimann, H., Chazelle, B., Pach, J.: How hard is half-space range searching. Discrete & Computational Geometry\u00a010, 143\u2013155 (1993)","journal-title":"Discrete & Computational Geometry"},{"key":"2_CR10","first-page":"152","volume-title":"SoCG 2004","author":"T.M. Chan","year":"2004","unstructured":"Chan, T.M.: Faster core-set constructions and data stream algorithms in fixed dimensions. In: SoCG 2004. Proceedings of the 20th ACM Symp. on Computational Geometry, pp. 152\u2013159. ACM Press, New York (2004)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"637","DOI":"10.2307\/1990891","volume":"2","author":"B. Chazelle","year":"1989","unstructured":"Chazelle, B.: Lower bounds on the complexity of polytope range searching. J. Amer. Math. Soc.\u00a02, 637\u2013666 (1989)","journal-title":"J. Amer. Math. Soc."},{"key":"2_CR12","unstructured":"Chazelle, B., Liu, D., Magen, A.: Approximate range searching in higher dimension. In: CCCG 2004. Proceedings of the 16th Canadian Conference on Computational Geometry, pp. 154\u2013157 (2004)"},{"key":"2_CR13","first-page":"131","volume-title":"SoCG 1989","author":"B. Chazelle","year":"1989","unstructured":"Chazelle, B., Rosenberg, B.: Computing partial sums in multidimensional arrays. In: SoCG 1989. Proc. 5th ACM Symp. Comput. Geom., pp. 131\u2013139. ACM Press, New York (1989)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"da Fonseca, G.D., Mount, D.M.: Approximate range searching: The absolute model. Technical Report CS-TR-4873, Computer Science Department, University of Maryland (2007)","DOI":"10.1007\/978-3-540-73951-7_2"},{"issue":"3","key":"2_CR15","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0925-7721(92)90006-E","volume":"2","author":"J. Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J.: Reporting points in halfspaces. Comput. Geom. Theory Appl.\u00a02(3), 169\u2013186 (1992)","journal-title":"Comput. Geom. Theory Appl."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02573972","volume":"10","author":"J. Matou\u0161ek","year":"1993","unstructured":"Matou\u0161ek, J.: Range searching with efficient hiearchical cuttings. Discrete & Computational Geometry\u00a010, 157\u2013182 (1993)","journal-title":"Discrete & Computational Geometry"},{"issue":"4","key":"2_CR17","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1145\/197405.197408","volume":"26","author":"J. Matou\u0161ek","year":"1994","unstructured":"Matou\u0161ek, J.: Geometric range searching. ACM Computing Surveys\u00a026(4), 421\u2013461 (1994)","journal-title":"ACM Computing Surveys"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S.: Data streams: Algorithms and applications. Now Publishers (2005)","DOI":"10.1561\/0400000002"},{"issue":"4","key":"2_CR19","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/s00454-006-1269-4","volume":"36","author":"S. Suri","year":"2006","unstructured":"Suri, S., T\u00f3th, C.D., Zhou, Y.: Range counting over multidimensional data streams. Discrete & Computational Geometry\u00a036(4), 633\u2013655 (2006)","journal-title":"Discrete & Computational Geometry"},{"issue":"2","key":"2_CR20","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R.E. Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. ACM\u00a022(2), 215\u2013225 (1975)","journal-title":"J. ACM"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1145\/800070.802185","volume-title":"STOC 1982","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Space-time tradeoff for answering range queries. In: STOC 1982. Proc. 14th ACM Symp. on Theory of Computing, pp. 128\u2013136. ACM Press, New York (1982)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73951-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T21:07:57Z","timestamp":1684012077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73951-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540739487","9783540739517"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73951-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}