{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:23:41Z","timestamp":1725542621203},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642003110"},{"type":"electronic","value":"9783642003127"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00312-7_22","type":"book-chapter","created":{"date-parts":[[2009,12,29]],"date-time":"2009-12-29T06:35:02Z","timestamp":1262068502000},"page":"351-365","source":"Crossref","is-referenced-by-count":0,"title":["On Approximate Geodesic-Distance Queries amid Deforming Point Clouds"],"prefix":"10.1007","author":[{"given":"Pankaj K.","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alon","family":"Efrat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Sharathkumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"1689","DOI":"10.1137\/S0097539793253371","volume":"26","author":"P.K. Agarwal","year":"1997","unstructured":"Agarwal, P.K., Aronov, B., O\u2019Rourke, J., Schevon, C.: Star unfolding of a polytope with applications. SIAM J. Comput.\u00a026, 1689\u20131713 (1997)","journal-title":"SIAM J. Comput."},{"key":"22_CR2","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., Hershberger, J., Veach, E.: Maintaining the extent of a moving point set. Discrete Comput. Geom.\u00a026, 353\u2013374 (2001)","journal-title":"Discrete Comput. Geom."},{"unstructured":"Agarwal, P.K., Sharathkumar, R., Yu, H.: Approximate Euclidean shortest paths amid convex obstacles. In: Proc. 20th ACM-SIAM Sympos. Discrete Algorithms (to appear)","key":"22_CR3"},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.comgeo.2006.01.002","volume":"36","author":"G. Alexandron","year":"2007","unstructured":"Alexandron, G., Kaplan, H., Sharir, M.: Kinetic and dynamic data structures for convex hulls and upper envelopes. Comput. Geom. Theory Appl.\u00a036, 144\u2013158 (2007)","journal-title":"Comput. Geom. Theory Appl."},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1007\/3-540-61680-2_79","volume-title":"Algorithms - ESA \u201996","author":"S. Arikati","year":"1996","unstructured":"Arikati, S., Chen, D., Chew, L., Das, G., Smid, M., Zaroliagis, C.: Planar spanners and approximate shortest path queries among obstacles in the plane. In: D\u00edaz, J. (ed.) ESA 1996. LNCS, vol.\u00a01136, pp. 514\u2013528. Springer, Heidelberg (1996)"},{"key":"22_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"},{"unstructured":"Chen, D.: On the all-pairs Euclidean short path problem. In: Proc. 6th Annu. ACM-SIAM Sympos. Discrete Algorithms, pp. 292\u2013301 (1995)","key":"22_CR7"},{"unstructured":"Chiang, Y.-J., Mitchell, J.S.B.: Two-point Euclidean shortest path queries in the plane. In: Proc. 10th Annu. ACM-SIAM Sympos. Discrete Algorithms, pp. 215\u2013224 (1999)","key":"22_CR8"},{"doi-asserted-by":"crossref","unstructured":"Clarkson, K.: Approximation algorithms for shortest path motion planning. In: Proc. 19th Annu. ACM Sympos. Theory Comput., pp. 56\u201365 (1987)","key":"22_CR9","DOI":"10.1145\/28395.28402"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/BFb0032047","volume-title":"Automata, Languages and Programming","author":"D.P. Dobkin","year":"1990","unstructured":"Dobkin, D.P., Kirkpatrick, D.G.: Determining the separation of preprocessed polyhedra \u2014 a unified approach. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 400\u2013413. Springer, Heidelberg (1990)"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/PL00009417","volume":"21","author":"S. Har-Peled","year":"1999","unstructured":"Har-Peled, S.: Approximate shortest-path and geodesic diameter on convex polytopes in three dimensions. Discrete Comput. Geom.\u00a021, 217\u2013231 (1999)","journal-title":"Discrete Comput. Geom."},{"key":"22_CR12","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0925-7721(97)00004-7","volume":"10","author":"J. Hershberger","year":"1998","unstructured":"Hershberger, J., Suri, S.: Practical methods for approximating shortest paths on a convex polytope in \u211d3. Comput. Geom. Theory Appl.\u00a010, 31\u201346 (1998)","journal-title":"Comput. Geom. Theory Appl."},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"2215","DOI":"10.1137\/S0097539795289604","volume":"28","author":"J. Hershberger","year":"1999","unstructured":"Hershberger, J., Suri, S.: An optimal algorithm for Euclidean shortest paths in the plane. SIAM J. Comput.\u00a028, 2215\u20132256 (1999)","journal-title":"SIAM J. Comput."},{"key":"22_CR14","first-page":"787","volume-title":"Handbook of Discrete and Computational Geometry","author":"M. Ling","year":"2004","unstructured":"Ling, M., Manocha, D.: Collision and proximity queries. In: Goodman, J., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn., pp. 787\u2013808. CRC Press, Boca Raton (2004)","edition":"2"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/BF01940877","volume":"16","author":"J. Matou\u0161ek","year":"1996","unstructured":"Matou\u0161ek, J., Sharir, M., Welzl, E.: A subexponential bound for linear programming. Algorithmica\u00a016, 498\u2013516 (1996)","journal-title":"Algorithmica"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","volume":"23","author":"M. Overmars","year":"1981","unstructured":"Overmars, M., van Leeuwen, J.: Maintenance of configurations in the plane. J. Comput. Syst. Sci.\u00a023, 166\u2013204 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR17","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1145\/179812.179911","volume":"41","author":"J. Reif","year":"1994","unstructured":"Reif, J., Sharir, M.: Motion planning in the presence of moving obstacles. J. Assoc. Comput. Mach.\u00a041, 764\u2013790 (1994)","journal-title":"J. Assoc. Comput. Mach."},{"unstructured":"van den Berg, J.: Path Planning in Dynamic Environments. PhD thesis, Utrecht University (2007)","key":"22_CR18"}],"container-title":["Springer Tracts in Advanced Robotics","Algorithmic Foundation of Robotics VIII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00312-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T13:17:02Z","timestamp":1558185422000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00312-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642003110","9783642003127"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00312-7_22","relation":{},"ISSN":["1610-7438","1610-742X"],"issn-type":[{"type":"print","value":"1610-7438"},{"type":"electronic","value":"1610-742X"}],"subject":[],"published":{"date-parts":[[2009]]}}}