{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:10:09Z","timestamp":1725556209270},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131219"},{"type":"electronic","value":"9783642131226"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13122-6_27","type":"book-chapter","created":{"date-parts":[[2010,5,20]],"date-time":"2010-05-20T09:26:31Z","timestamp":1274347591000},"page":"272-283","source":"Crossref","is-referenced-by-count":0,"title":["Simple Wriggling Is Hard Unless You Are a Fat Hippo"],"prefix":"10.1007","author":[{"given":"Irina","family":"Kostitsyna","sequence":"first","affiliation":[]},{"given":"Valentin","family":"Polishchuk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"27_CR1","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1137\/S0097539795295936","volume":"29","author":"P.K. Agarwal","year":"2000","unstructured":"Agarwal, P.K., Efrat, A., Sharir, M.: Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. SIJCOMP\u00a029(3), 912\u2013953 (2000)","journal-title":"SIJCOMP"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1145\/299917.299918","volume":"30","author":"P.K. Agarwal","year":"1998","unstructured":"Agarwal, P.K., Sharir, M.: Efficient algorithms for geometric optimization. ACM Computing Surveys\u00a030, 412\u2013458 (1998)","journal-title":"ACM Computing Surveys"},{"issue":"11-12","key":"27_CR3","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1177\/0278364908097661","volume":"27","author":"R. Alterovitz","year":"2008","unstructured":"Alterovitz, R., Branicky, M.S., Goldberg, K.Y.: Motion planning under uncertainty for image-guided medical needle steering. Int. J. Rob. Res.\u00a027(11-12), 1361\u20131374 (2008)","journal-title":"Int. J. Rob. Res."},{"issue":"3","key":"27_CR4","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.comgeo.2009.02.007","volume":"43","author":"E.M. Arkin","year":"2010","unstructured":"Arkin, E.M., Mitchell, J.S.B., Polishchuk, V.: Maximum thick paths in static and dynamic environments. Comp. Geom. Theory and Appl.\u00a043(3), 279\u2013294 (2010)","journal-title":"Comp. Geom. Theory and Appl."},{"key":"27_CR5","unstructured":"Asano, T., Kirkpatrick, D., Yap, C.K.: d 1-optimal motion for a rod. In: SoCG 1996 (1996)"},{"key":"27_CR6","unstructured":"Asano, T., Kirkpatrick, D., Yap, C.K.: Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard. In: CCCG 2003 (2003)"},{"key":"27_CR7","unstructured":"Barcia, J., Diaz-Banez, J., Gomez, F., Ventura, I.: The anchored Voronoi diagram: static and dynamic versions and applications. In: EuroCG 2003 (2003)"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Bereg, S., Kirkpatrick, D.: Curvature-bounded traversals of narrow corridors. In: SoCG 2005 (2005)","DOI":"10.1145\/1064092.1064135"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Chew, L.P.: Planning the shortest path for a disc in O(n 2 logn) time. In: SoCG 1985 (1985)","DOI":"10.1145\/323233.323261"},{"key":"27_CR10","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1109\/MCSE.2008.58","volume":"10","author":"D. Chowdhury","year":"2008","unstructured":"Chowdhury, D.: Molecular motors: Design, mechanism, and control. Computing in Science and Engineering\u00a010, 70\u201377 (2008)","journal-title":"Computing in Science and Engineering"},{"key":"27_CR11","unstructured":"Cook IV, A.F., Wenk, C., Daescu, O., Bitner, S., Cheung, Y.K., Kurdia, A.: Visiting a sequence of points with a bevel-tip needle. In: LATIN 2010 (2010)"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF02711511","volume":"16","author":"A. Efrat","year":"1996","unstructured":"Efrat, A., Sharir, M.: A near-linear algorithm for the planar segment center problem. Discrete & Computational Geometry\u00a016, 239\u2013257 (1996)","journal-title":"Discrete & Computational Geometry"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1109\/70.265921","volume":"9","author":"T. Hu","year":"1993","unstructured":"Hu, T., Kahng, A., Robins, G.: Optimal robust path planning in general environments. IEEE Transactions on Robotics and Automation\u00a09, 775\u2013784 (1993)","journal-title":"IEEE Transactions on Robotics and Automation"},{"issue":"5","key":"27_CR14","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1177\/0278364905053687","volume":"24","author":"J.Y. Lee","year":"2005","unstructured":"Lee, J.Y., Choset, H.: Sensor-based planning for a rod-shaped robot in three dimensions: Piecewise retracts of R3 x S2. Int. J. Rob. Res.\u00a024(5), 343\u2013383 (2005)","journal-title":"Int. J. Rob. Res."},{"issue":"2","key":"27_CR15","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIJCOMP\u00a011(2), 329\u2013343 (1982)","journal-title":"SIJCOMP"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Pach, J., Tardos, G.: Forbidden patterns and unit distances. In: SoCG 2005 (2005)","DOI":"10.1145\/1064092.1064096"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01840368","volume":"2","author":"S. Sifrony","year":"1987","unstructured":"Sifrony, S., Sharir, M.: A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space. Algorithmica\u00a02, 367\u2013402 (1987)","journal-title":"Algorithmica"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1038\/19104","volume":"398","author":"C. Veigel","year":"1999","unstructured":"Veigel, C., Coluccio, L.M., Jontes, J.D., Sparrow, J.C., Milligan, R.A., Molloy, J.: The motor protein myosin-I produces its working stroke in two steps. Nature\u00a0398, 530\u2013533 (1999)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Fun with Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13122-6_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:01:47Z","timestamp":1606186907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13122-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131219","9783642131226"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13122-6_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}