{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:15:46Z","timestamp":1725470146103},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388753"},{"type":"electronic","value":"9783540388760"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_56","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T13:20:54Z","timestamp":1157980854000},"page":"624-635","source":"Crossref","is-referenced-by-count":1,"title":["Out-of-Order Event Processing in Kinetic Data Structures"],"prefix":"10.1007","author":[{"given":"Mohammad Ali","family":"Abam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pankaj K.","family":"Agarwal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"de Berg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"56_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":"56_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Gao, J., Guibas, L.J.: Kinetic medians and kd-trees. In: Proc. 10th European Sympos. on Algorithms, pp. 5\u201316 (2002)","DOI":"10.1007\/3-540-45749-6_5"},{"issue":"3","key":"56_CR3","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s00454-001-0019-x","volume":"26","author":"P.K. Agarwal","year":"2001","unstructured":"Agarwal, P.K., Guibas, L.J., Hershberger, J., Veach, E.: Maintaining the extent of a moving point set. Discrete Comput. Geom.\u00a026(3), 353\u2013374 (2001)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"56_CR4","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1145\/1008731.1008736","volume":"51","author":"P.K. Agarwal","year":"2004","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. J. ACM\u00a051(4), 606\u2013635 (2004)","journal-title":"J. ACM"},{"key":"56_CR5","doi-asserted-by":"crossref","unstructured":"Alexandron, G., Kaplan, H., Sharir, M.: Kinetic and dynamic data structures for convex hulls and upper envelopes. In: Proc. 9th Intl. Workshop on Data Structures, pp. 269\u2013281 (2005)","DOI":"10.1007\/11534273_24"},{"key":"56_CR6","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.J., Hershberger, J.: Data structures for mobile data. J. Algorithms\u00a031, 1\u201328 (1999)","journal-title":"J. Algorithms"},{"key":"56_CR7","doi-asserted-by":"crossref","unstructured":"Basch, J., Guibas, L.J., Zhang, L.: Proximity problems on moving points. In: Proc. 13th ACM Sympos. Comput. Geom., pp. 344\u2013351 (1997)","DOI":"10.1145\/262839.262998"},{"key":"56_CR8","unstructured":"The CGAL Library, http:\/\/www.cgal.org\/"},{"key":"56_CR9","doi-asserted-by":"crossref","unstructured":"Collins, G., Akritas, A.: Polynomial real root isolation using Descarte\u2019s rule of signs. In: Proc. 3rd ACM Sympos. Symbol. Algebra. Comput., pp. 272\u2013275 (1976)","DOI":"10.1145\/800205.806346"},{"key":"56_CR10","unstructured":"The Core Library, http:\/\/www.cs.nyu.edu\/exact\/"},{"key":"56_CR11","unstructured":"Fortune, S.: Progress in computational geometry. In: Martin, R. (ed.) Directions in Geometric Computing, pp. 81\u2013128. Information Geometers Ltd. (1993)"},{"key":"56_CR12","unstructured":"Funke, S., Klein, C., Mehlhorn, K., Schmitt, S.: Controlled perturbation for Delaunay triangulations. In: Proc. 16th ACM-SIAM Sympos. Discrete Algorithms, pp. 1047\u20131056 (2005)"},{"key":"56_CR13","volume-title":"Handbook of Discrete and Computational Geometry","author":"L.J. Guibas","year":"2004","unstructured":"Guibas, L.J.: Algorithms for tracking moving objects. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn. CRC Press, Boca Raton (2004)","edition":"2"},{"key":"56_CR14","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Karavelas, M.: Interval methods for kinetic simulation. In: Proc. 15th Annu. ACM Sympos. Comput. Geom., pp. 255\u2013264 (1999)","DOI":"10.1145\/304893.304978"},{"key":"56_CR15","unstructured":"Guibas, L.J., Karavelas, M., Russel, D.: A computational framework for handling motion. In: Proc. 6th Workshop on Algorithm Engineering and Experiments, pp. 129\u2013141 (2004)"},{"key":"56_CR16","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Russel, D.: An empirical comparision of techniques for updating Delaunay triangulations. In: Proc. 20th Annu. Sympos. Comput. Geom., pp. 170\u2013179 (2004)","DOI":"10.1145\/997817.997846"},{"key":"56_CR17","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0925-7721(98)00014-5","volume":"10","author":"D. Halperin","year":"1998","unstructured":"Halperin, D., Shelton, C.: A perturbation scheme for spherical arrangements with application to molecular modeling. Comput. Geom. Theory Appl.\u00a010, 273\u2013287 (1998)","journal-title":"Comput. Geom. Theory Appl."},{"key":"56_CR18","volume-title":"Basic Algebra I","author":"N. Jacobson","year":"1985","unstructured":"Jacobson, N.: Basic Algebra I, 2nd edn. W.H. Freeman, New York (1985)","edition":"2"},{"key":"56_CR19","doi-asserted-by":"crossref","unstructured":"Milenkovic, V., Sacks, E.: An approximate arrangement algorithm for semi-algebraic curves. In: Proc. 22nd Annu. Sympos. Comput. Geom., pp. 237\u2013246 (2006)","DOI":"10.1145\/1137856.1137892"},{"key":"56_CR20","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/B978-044482537-7\/50015-2","volume-title":"Handbook of Computational Geometry","author":"S. Schirra","year":"2000","unstructured":"Schirra, S.: Robustness and precision issues in geometric computation. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 597\u2013632. Elsevier Science, Amsterdam (2000)"},{"key":"56_CR21","volume-title":"Handbook of Discrete and Computational Geometry","author":"C. Yap","year":"2004","unstructured":"Yap, C.: Robust geometric computation. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn. CRC Press, Boca Raton (2004)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T03:32:32Z","timestamp":1555817552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11841036_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}