{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T04:10:01Z","timestamp":1746850201289,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540877431"},{"type":"electronic","value":"9783540877448"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87744-8_3","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T09:20:52Z","timestamp":1220088052000},"page":"29-40","source":"Crossref","is-referenced-by-count":26,"title":["Robust Kinetic Convex Hulls in 3D"],"prefix":"10.1007","author":[{"given":"Umut A.","family":"Acar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy E.","family":"Blelloch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kanat","family":"Tangwongsan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duru","family":"T\u00fcrko\u011flu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Acar, U.A., Ahmed, A., Blume, M.: Imperative self-adjusting computation. In: Proceedings of the 25th Annual ACM Symposium on Principles of Programming Languages (POPL) (2008)","DOI":"10.1145\/1328438.1328476"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1007\/11841036_56","volume-title":"Algorithms \u2013 ESA 2006","author":"M.A. Abam","year":"2006","unstructured":"Abam, M.A., Agarwal, P.K., de Berg, M., Yu, H.: Out-of-order event processing in kinetic data structures. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 624\u2013635. Springer, Heidelberg (2006)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Acar, U.A., Blelloch, G.E., Blume, M., Tangwongsan, K.: An experimental analysis of self-adjusting computation. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (2006)","DOI":"10.1145\/1133981.1133993"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/978-3-540-71316-6_31","volume-title":"Programming Languages and Systems","author":"U.A. Acar","year":"2007","unstructured":"Acar, U.A., Blume, M., Donham, J.: A consistent semantics of self-adjusting computation. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421, pp. 458\u2013474. Springer, Heidelberg (2007)"},{"key":"3_CR5","unstructured":"Acar, U.A., Blelloch, G.E., Harper, R., Vittes, J.L., Woo, M.: Dynamizing static algorithms with applications to dynamic trees and history independence. In: ACM-SIAM Symposium on Discrete Algorithms (SODA) (2004)"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/11841036_57","volume-title":"Algorithms \u2013 ESA 2006","author":"U.A. Acar","year":"2006","unstructured":"Acar, U.A., Blelloch, G.E., Tangwongsan, K., Vittes, J.L.: Kinetic algorithms via self-adjusting computation. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 636\u2013647. Springer, Heidelberg (2006)"},{"key":"3_CR7","unstructured":"Acar, U.A.: Self-Adjusting Computation. PhD thesis, Department of Computer Science, Carnegie Mellon University (May 2005)"},{"issue":"4","key":"3_CR8","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1145\/592642.592647","volume":"34","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., Guibas, L.J., Edelsbrunner, H., Erickson, J., Isard, M., Har-Peled, S., Hershberger, J., Jensen, C., Kavraki, L., Koehl, P., Lin, M., Manocha, D., Metaxas, D., Mirtich, B., Mount, D., Muthukrishnan, S., Pai, D., Sacks, E., Snoeyink, J., Suri, S., Wolefson, O.: Algorithmic issues in modeling motion. ACM Comput. Surv.\u00a034(4), 550\u2013572 (2002)","journal-title":"ACM Comput. Surv."},{"key":"3_CR9","unstructured":"Acar, U.A., Hudson, B.: Optimal-time dynamic mesh refinement: preliminary results. In: Proceedings of the 16th Annual Fall Workshop on Computational Geometry (2006)"},{"issue":"4","key":"3_CR10","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/235815.235821","volume":"22","author":"C.B. Barber","year":"1996","unstructured":"Barber, C.B., Dobkin, D.P., Huhdanpaa, H.: The quickhull algorithm for convex hulls. ACM Trans. Math. Softw.\u00a022(4), 469\u2013483 (1996)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"3_CR11","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. Journal of Algorithms\u00a031(1), 1\u201328 (1999)","journal-title":"Journal of Algorithms"},{"key":"3_CR12","unstructured":"CGAL Editorial Board. CGAL User and Reference Manual, 3.3 edn. (2007)"},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"K.L. Clarkson","year":"1989","unstructured":"Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry, II. Discrete and Computational Geometry\u00a04(1), 387\u2013421 (1989)","journal-title":"Discrete and Computational Geometry"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1145\/304893.304978","volume-title":"SCG 1999: Proceedings of the fifteenth annual symposium on Computational geometry","author":"L.J. Guibas","year":"1999","unstructured":"Guibas, L.J., Karavelas, M.I.: Interval methods for kinetic simulations. In: SCG 1999: Proceedings of the fifteenth annual symposium on Computational geometry, pp. 255\u2013264. ACM Press, New York (1999)"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/997817.997846","volume-title":"SCG 2004: Proceedings of the twentieth annual symposium on Computational geometry","author":"L. Guibas","year":"2004","unstructured":"Guibas, L., Russel, D.: An empirical comparison of techniques for updating delaunay triangulations. In: SCG 2004: Proceedings of the twentieth annual symposium on Computational geometry, pp. 170\u2013179. ACM Press, New York (2004)"},{"key":"3_CR16","unstructured":"Guibas, L.J.: Kinetic data structures: a state of the art report. In: WAFR 1998: Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics: the algorithmic perspective, Natick, MA, USA, pp. 191\u2013209. A. K. Peters, Ltd (1998)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Guibas, L.: Modeling motion. In: Goodman, J., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn., pp. 1117\u20131134. Chapman and Hall\/CRC (2004)","DOI":"10.1201\/9781420035315.ch50"},{"key":"3_CR18","unstructured":"MLton"},{"key":"3_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"issue":"1-2","key":"3_CR20","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.comgeo.2006.11.006","volume":"38","author":"D. Russel","year":"2007","unstructured":"Russel, D., Karavelas, M.I., Guibas, L.J.: A package for exact kinetic data structures and sweepline algorithms. Comput. Geom. Theory Appl.\u00a038(1-2), 111\u2013127 (2007)","journal-title":"Comput. Geom. Theory Appl."},{"key":"3_CR21","unstructured":"Ruseel, D.: Kinetic Data Structures in Practice. PhD thesis, Department of Computer Science, Stanford University (March 2007)"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1159876.1159877","volume-title":"ML 2006: Proceedings of the 2006 workshop on ML","author":"S. Weeks","year":"2006","unstructured":"Weeks, S.: Whole-Program Compilation in Mlton. In: ML 2006: Proceedings of the 2006 workshop on ML, p. 1. ACM, New York (2006)"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2008"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87744-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:17:53Z","timestamp":1715059073000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87744-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540877431","9783540877448"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87744-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}