{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:40:22Z","timestamp":1742596822274,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575689"},{"type":"electronic","value":"9783540482338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57568-5_229","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:08:30Z","timestamp":1330261710000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["Reaching a goal with directional uncertainty"],"prefix":"10.1007","author":[{"given":"Mark","family":"Berg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonidas","family":"Guibas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Halperin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Overmars","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Otfried","family":"Schwarzkopf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha","family":"Sharir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monique","family":"Teillaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"B. Bhattacharya, D. G. Kirkpatrick, and G. T. Toussaint. Determining sector visibility of a polygon. In Proc. 5th Annu. ACM Sympos. Comput. Geom., pages 247\u2013254, 1989.","DOI":"10.1145\/73833.73861"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"A. J. Briggs. An efficient algorithm for one-step planar compliant motion planning with uncertainty. In Proc. 5th Annu. ACM Sympos. Comput. Geom., pages 187\u2013196, 1989.","DOI":"10.1145\/73833.73855"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01840394","volume":"5","author":"B. R. Donald","year":"1990","unstructured":"B. R. Donald. The complexity of planar compliant motion planning under uncertainty. Algorithmica, 5:353\u2013382, 1990.","journal-title":"Algorithmica"},{"key":"1_CR4","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF02187784","volume":"5","author":"H. Edelsbrunner","year":"1990","unstructured":"H. Edelsbrunner, L. J. Guibas, and M. Sharir. The complexity and construction of many faces in arrangements of lines and of segments. Discrete Comput. Geom., 5:161\u2013196, 1990.","journal-title":"Discrete Comput. Geom."},{"key":"1_CR5","unstructured":"M. Erdmann. On motion planning with uncertainty. Technical Report 810, AI Laboratory, MIT, 1984."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"J. Friedman, J. Hershberger, and J. Snoeyink. Compliant motion in a simple polygon. In Proc. 5th Annu. ACM Sympos. Comput. Geom., pages 175\u2013186, 1989.","DOI":"10.1145\/73833.73854"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"J. Friedman, J. Hershberger, and J. Snoeyink. Input-sensitive compliant motion in the plane. In Proc. 2nd Scand. Workshop Algorithm Theory, volume 447 of Lecture Notes in Computer Science, pages 225\u2013237. Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52846-6_92"},{"key":"1_CR8","unstructured":"P. Heckbert and J. Winget. Finite-element methods for global illumination. To appear."},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02187683","volume":"1","author":"K. Kedem","year":"1986","unstructured":"K. Kedem, R. Livne, J. Pach, and M. Sharir. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput. Geom., 1:59\u201371, 1986.","journal-title":"Discrete Comput. Geom."},{"key":"1_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot Motion Planning","author":"J.-C. Latombe","year":"1991","unstructured":"J.-C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, 1991."},{"key":"1_CR11","unstructured":"A. Lazanas and J.-C. Latombe. Landmark-based robot navigation. Submitted to Algorithmica."},{"key":"1_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1177\/027836498400300101","volume":"3","author":"T. Lozano-P\u00e9rez","year":"1984","unstructured":"T. Lozano-P\u00e9rez, M. T. Mason, and R. H. Taylor. Automatic synthesis of finemotion strategies for robots. Internat. J. Robotics Research, 3:3\u201324, 1984.","journal-title":"Internat. J. Robotics Research"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"J. Matousek, N. Miller, J. Pach, M. Sharir, S. Sifrony, and E. Welzl. Fat triangles determine linearly many holes. In Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci., pages 49\u201358, 1991.","DOI":"10.1109\/SFCS.1991.185347"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"M. van Kreveld. On fat partitioning, fat covering, and the union size of polygons. In Proc. 3rd Workshop Algorithms Data Struct., Lecture Notes in Computer Science, 1993.","DOI":"10.1007\/3-540-57155-8_270"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57568-5_229.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:11:10Z","timestamp":1742595070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57568-5_229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575689","9783540482338"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-57568-5_229","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}