{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:58:34Z","timestamp":1725566314716},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230250"},{"type":"electronic","value":"9783540301400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30140-0_3","type":"book-chapter","created":{"date-parts":[[2010,9,18]],"date-time":"2010-09-18T21:31:13Z","timestamp":1284845473000},"page":"4-15","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects"],"prefix":"10.1007","author":[{"given":"Pankaj K.","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Arge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeff","family":"Erickson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0022-0000(02)00035-1","volume":"66","author":"P.K. Agarwal","year":"2003","unstructured":"Agarwal, P.K., Arge, L., Erickson, J.: Indexing moving points. J. Comput. Syst. Sci.\u00a066, 207\u2013243 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Arge, L., Vahrenhold, J.: Time responsive external data structures for moving points. In: Proc. 7th Workshop on Algorithms and Data Structures, pp. 50\u201361 (2001)","DOI":"10.1007\/3-540-44634-6_6"},{"key":"3_CR3","first-page":"1","volume-title":"Advances in Discrete and Computational Geometry","author":"P.K. Agarwal","year":"1999","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 (1999)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Gao, J., Guibas, L.: Kinetic medians and kd-trees. In: Proc. 10th European Symposium on Algorithms, pp. 5\u201316 (2002)","DOI":"10.1007\/3-540-45749-6_5"},{"key":"3_CR5","first-page":"253","volume":"26","author":"P.K. Agarwal","year":"2001","unstructured":"Agarwal, P.K., Guibas, L., Hershberg, J., Veach, E.: Maintaining the extent of a moving point set. Discrete Comput. Geom.\u00a026, 253\u2013274 (2001)","journal-title":"Discrete Comput. Geom."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.: Approximating extent measure of points. Journal of the ACM (to appear)","DOI":"10.1145\/1008731.1008736"},{"key":"3_CR7","first-page":"25","volume":"25","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., Procopiuc, C.M.: Advances in indexing for moving objects. IEEE Bulletin of Data Engineering\u00a025, 25\u201334 (2002)","journal-title":"IEEE Bulletin of Data Engineering"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/B978-044482537-7\/50003-6","volume-title":"Handbook of Computational Geometry","author":"P.K. Agarwal","year":"2000","unstructured":"Agarwal, P.K., Sharir, M.: Arrangements and their applications. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 49\u2013119. Elsevier Science Publishers, North-Holland, Amsterdam (2000)"},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1998.0988","volume":"31","author":"J. Basch","year":"1999","unstructured":"Basch, J., Guibas, L., Hershberger, J.: Data structures for mobile data. J. Algorithms\u00a031(1), 1\u201328 (1999)","journal-title":"J. Algorithms"},{"issue":"1","key":"3_CR10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0925-7721(97)00025-4","volume":"10","author":"H. Br\u00f6nnimann","year":"1998","unstructured":"Br\u00f6nnimann, H., Chazelle, B.: Optimal slope selection via cuttings. Comp. Geom. Theory & Appl.\u00a010(1), 23\u201329 (1998)","journal-title":"Comp. Geom. Theory & Appl."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: Fixed-dimensional linear programming queries made easy. In: Proc. 12th Annu. Sympos. Comput. Geom., pp. 284\u2013290 (1996)","DOI":"10.1145\/237218.237397"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: Faster core-set constructions and data stream algorithms in fixed dimensions. In: Proc. 20th Annu. Sympos. Comput. Geom., pp. 152\u2013159 (2004)","DOI":"10.1145\/997817.997843"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02189314","volume":"9","author":"B. Chazelle","year":"1993","unstructured":"Chazelle, B.: Cutting hyperplanes for divide-and-conquer. Discrete Comput. Geom.\u00a09, 145\u2013158 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/BF01955043","volume":"15","author":"B. Chazelle","year":"1996","unstructured":"Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., Stolfi, J.: Lines in space: Combinatorics and algorithms. Algorithmica\u00a015, 428\u2013447 (1996)","journal-title":"Algorithmica"},{"key":"3_CR15","unstructured":"Czumaj, A., Sohler, C.: Soft kinetic data structures. In: Proc. 12th ACM-SIAM Sympos. Discrete Algorithms, pp. 865\u2013872 (2001)"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Kollios, G., Gunopulos, D., Tsotras, V.: Nearest neighbor queries in a mobile environment. In: Proc. Intl. Workshop on Spatiotemporal Database Management, pp. 119\u2013134 (1999)","DOI":"10.1007\/3-540-48344-6_7"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Kollios, G., Gunopulos, D., Tsotras, V.: On indexing mobile objects. In: Proc. ACM Sympos. Principles Database Syst., pp. 261\u2013272 (1999)","DOI":"10.1145\/303976.304002"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF02293051","volume":"8","author":"J. Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J.: Efficient partition trees. Discrete Comput. Geom.\u00a08, 315\u2013334 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1006\/jagm.1993.1023","volume":"14","author":"J. Matou\u0161ek","year":"1993","unstructured":"Matou\u0161ek, J.: Linear optimization queries. J. Algorithms\u00a014, 432\u2013448 (1993)","journal-title":"J. Algorithms"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Procopiuc, C.M., Agarwal, P.K., Har-Peled, S.: STAR-tree: an efficient selfadjusting index for moving points. In: Proc 4th Workshop on Algorithms Engineering and Experiments, pp. 178\u2013193 (2002)","DOI":"10.1007\/3-540-45643-0_14"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Ramos, E.: Linear programming queries revisited. In: Proc. 16th Annu. Sympos. Comput. Geom., pp. 176\u2013181 (2000)","DOI":"10.1145\/336154.336198"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Saltenis, S., Jensen, C., Leutenegger, S., L\u00f3pez, M.: Indexing the positions of continuously moving objects. In: Proc. SIGMOD Intl. Conf. Management of Data, pp. 331\u2013342 (2000)","DOI":"10.1145\/342009.335427"},{"issue":"7","key":"3_CR23","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/6138.6151","volume":"29","author":"N. Sarnak","year":"1986","unstructured":"Sarnak, N., Tarjan, R.: Planar point location using persistent search trees. Communications of the ACM\u00a029(7), 669\u2013679 (1986)","journal-title":"Communications of the ACM"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Yu, H., Agarwal, P.K., Poreddy, R., Varadarajan, K.R.: Practical methods for shape fitting and kinetic data structures using core sets. In: Proc. 20th Annu. Sympos. Comput. Geom., pp. 263\u2013272 (2004)","DOI":"10.1145\/997817.997858"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30140-0_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:52:08Z","timestamp":1619999528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30140-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230250","9783540301400"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30140-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}