{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T22:33:23Z","timestamp":1648766003349},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,11,3]],"date-time":"2009-11-03T00:00:00Z","timestamp":1257206400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s00453-009-9335-y","type":"journal-article","created":{"date-parts":[[2009,11,2]],"date-time":"2009-11-02T10:54:22Z","timestamp":1257159262000},"page":"250-273","source":"Crossref","is-referenced-by-count":0,"title":["Out-of-Order Event Processing in Kinetic Data Structures"],"prefix":"10.1007","volume":"60","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","published-online":{"date-parts":[[2009,11,3]]},"reference":[{"key":"9335_CR1","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. 26, 353\u2013374 (2001)","journal-title":"Discrete Comput. Geom."},{"key":"9335_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Gao, J., Guibas, L.J.: Kinetic medians and kd-trees. In: Proc. 10th European Sympos. Algorithms, pp. 5\u201316 (2002)","DOI":"10.1007\/3-540-45749-6_5"},{"key":"9335_CR3","doi-asserted-by":"crossref","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. 66, 207\u2013243 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"9335_CR4","doi-asserted-by":"crossref","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 51, 606\u2013635 (2004)","journal-title":"J. ACM"},{"key":"9335_CR5","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.comgeo.2006.01.002","volume":"36","author":"G. Alexandron","year":"2006","unstructured":"Alexandron, G., Kaplan, H., Sharir, M.: Kinetic and dynamic data structures for convex hulls and upper envelopes. Comput. Geom. Theory Appl. 36, 144\u2013158 (2006)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9335_CR6","doi-asserted-by":"crossref","unstructured":"Basch, J., Guibas, L.J., Zhang, L.: Proximity problems on moving points. In: Proc. 13th Annu. Sympos. Comput. Geom., pp. 344\u2013351 (1997)","DOI":"10.1145\/262839.262998"},{"key":"9335_CR7","doi-asserted-by":"crossref","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 31, 1\u201328 (1999)","journal-title":"J. Algorithms"},{"key":"9335_CR8","unstructured":"The CGAL Library, http:\/\/www.cgal.org\/"},{"key":"9335_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":"9335_CR10","unstructured":"The Core Library, http:\/\/www.cs.nyu.edu\/exact\/"},{"key":"9335_CR11","first-page":"81","volume-title":"Directions in Geometric Computing","author":"S. Fortune","year":"1993","unstructured":"Fortune, S.: Progress in computational geometry. In: Martin, R. (ed.) Directions in Geometric Computing, pp. 81\u2013128. Information Geometers Ltd., Winchester (1993)"},{"key":"9335_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":"9335_CR13","first-page":"1117","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., pp. 1117\u20131134. CRC Press, Boca Raton (2004)","edition":"2"},{"key":"9335_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":"9335_CR15","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Russel, D.: An empirical comparison of techniques for updating Delaunay triangulations. In: Proc. 20th Annu. Sympos. Comput. Geom., pp. 170\u2013179 (2004)","DOI":"10.1145\/997817.997846"},{"key":"9335_CR16","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":"9335_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. 10, 273\u2013287 (1998)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9335_CR18","volume-title":"Basic Algebra I","author":"N. Jacobson","year":"1985","unstructured":"Jacobson, N.: Basic Algebra I, 2nd edn. Freeman, New York (1985)","edition":"2"},{"key":"9335_CR19","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K., Osbild, R., Sagraloff, M.: Reliable and efficient computational geometry via controlled perturbation. In: Proc. 33rd Internat. Colloq. Automat. Langu. Program., pp. 299\u2013310 (2006)","DOI":"10.1007\/11786986_27"},{"key":"9335_CR20","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1142\/S021819590700229X","volume":"17","author":"V. Milenkovic","year":"2007","unstructured":"Milenkovic, V., Sacks, E.: An approximate arrangement algorithm for semi-algebraic curves. Int. J. Comput. Geom. Appl. 17, 175\u2013198 (2007)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9335_CR21","doi-asserted-by":"crossref","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, Amsterdam (2000)"},{"key":"9335_CR22","first-page":"927","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., pp. 927\u2013952. CRC Press, Boca Raton (2004)","edition":"2"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9335-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-009-9335-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9335-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:04Z","timestamp":1559123104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9335-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,3]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["9335"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9335-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,3]]}}}