{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:12Z","timestamp":1759638372134},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,6,15]],"date-time":"2011-06-15T00:00:00Z","timestamp":1308096000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s00224-011-9337-4","type":"journal-article","created":{"date-parts":[[2011,6,14]],"date-time":"2011-06-14T05:51:27Z","timestamp":1308030687000},"page":"93-110","source":"Crossref","is-referenced-by-count":1,"title":["Simple Wriggling is Hard Unless You Are a Fat Hippo"],"prefix":"10.1007","volume":"50","author":[{"given":"Irina","family":"Kostitsyna","sequence":"first","affiliation":[]},{"given":"Valentin","family":"Polishchuk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,15]]},"reference":[{"key":"9337_CR1","doi-asserted-by":"crossref","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 Comput. Surv. 30, 412\u2013458 (1998)","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"9337_CR2","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. SIAM J. Comput. 29(3), 912\u2013953 (2000)","journal-title":"SIAM J. Comput."},{"issue":"11\u201312","key":"9337_CR3","doi-asserted-by":"crossref","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. Robot. Res. 27(11\u201312), 1361\u20131374 (2008)","journal-title":"Int. J. Robot. Res."},{"issue":"3","key":"9337_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. Comput. Geom. 43(3), 279\u2013294 (2010)","journal-title":"Comput. Geom."},{"key":"9337_CR5","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1145\/237218.237394","volume-title":"Proceedings of the 12th Annual ACM Symposium on Computational Geometry","author":"T. Asano","year":"1996","unstructured":"Asano, T., Kirkpatrick, D., Yap, C.K.: d 1-optimal motion for a rod. In: Proceedings of the 12th Annual ACM Symposium on Computational Geometry, pp. 252\u2013263 (1996)"},{"key":"9337_CR6","first-page":"10","volume-title":"Proceeding of Canadian Conference on Computational Geometry","author":"T. Asano","year":"2003","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: Proceeding of Canadian Conference on Computational Geometry, pp. 10\u201313 (2003)"},{"key":"9337_CR7","volume-title":"19th European Workshop on Computational Geometry","author":"J. Barcia","year":"2003","unstructured":"Barcia, J., Diaz-Banez, J., Gomez, F., Ventura, I.: The anchored Voronoi diagram: static and dynamic versions and applications. In: 19th European Workshop on Computational Geometry (2003)"},{"key":"9337_CR8","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1145\/1064092.1064135","volume-title":"Proceedings of the 21st Annual Symposium on Computational geometry","author":"S. Bereg","year":"2005","unstructured":"Bereg, S., Kirkpatrick, D.: Curvature-bounded traversals of narrow corridors. In: Proceedings of the 21st Annual Symposium on Computational geometry, pp. 278\u2013287 (2005)"},{"key":"9337_CR9","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/323233.323261","volume-title":"Proceedings of the 1st Annual Symposium on Computational Geometry","author":"L.P. Chew","year":"1985","unstructured":"Chew, L.P.: Planning the shortest path for a disc in O(n 2log\u2009n) time. In: Proceedings of the 1st Annual Symposium on Computational Geometry, pp. 214\u2013220 (1985)"},{"key":"9337_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. Comput. Sci. Eng. 10, 70\u201377 (2008)","journal-title":"Comput. Sci. Eng."},{"key":"9337_CR11","volume-title":"Proceedings of the 9th Latin American Theoretical Informatics Symposium","author":"A.F. Cook IV","year":"2010","unstructured":"A.F. Cook\u00a0IV, Wenk, C., Daescu, O., Bitner, S., Cheung, Y.K., Kurdia, A.: Visiting a sequence of points with a bevel-tip needle. In: Proceedings of the 9th Latin American Theoretical Informatics Symposium (2010)"},{"key":"9337_CR12","doi-asserted-by":"crossref","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 Comput. Geom. 16, 239\u2013257 (1996)","journal-title":"Discrete Comput. Geom."},{"key":"9337_CR13","doi-asserted-by":"crossref","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 Trans. Robot. Autom. 9, 775\u2013784 (1993)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"9337_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot Motion Planning","author":"J.-C. Latombe","year":"1991","unstructured":"Latombe, J.-C.: Robot Motion Planning. Kluwer Academic, Boston (1991)"},{"key":"9337_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546877","volume-title":"Planning Algorithms","author":"S.M. LaValle","year":"2006","unstructured":"LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006)"},{"issue":"5","key":"9337_CR16","doi-asserted-by":"crossref","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\u00d7S2. Int. J. Robot. Res. 24(5), 343\u2013383 (2005)","journal-title":"Int. J. Robot. Res."},{"issue":"2","key":"9337_CR17","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. SIAM J. Comput. 11(2), 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"key":"9337_CR18","volume-title":"Single-Layer Wire Routing and Compaction","author":"F.M. Maley","year":"1990","unstructured":"Maley, F.M.: Single-Layer Wire Routing and Compaction. MIT Press, Cambridge (1990)"},{"key":"9337_CR19","volume-title":"Theoretical Foundations of VLSI Design","year":"1991","unstructured":"McEvoy, K., Tucker, J.V. (eds.): Theoretical Foundations of VLSI Design. Cambridge University Press, New York (1991)"},{"key":"9337_CR20","first-page":"1","volume-title":"Proceedings of the 21st Annual Symposium on Computational Geometry","author":"J. Pach","year":"2005","unstructured":"Pach, J., Tardos, G.: Forbidden patterns and unit distances. In: Proceedings of the 21st Annual Symposium on Computational Geometry, pp. 1\u20139 (2005)"},{"key":"9337_CR21","doi-asserted-by":"crossref","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 2, 367\u2013402 (1987)","journal-title":"Algorithmica"},{"key":"9337_CR22","doi-asserted-by":"crossref","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 398, 530\u2013533 (1999)","journal-title":"Nature"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9337-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-011-9337-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9337-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T10:37:11Z","timestamp":1686134231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-011-9337-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,15]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["9337"],"URL":"https:\/\/doi.org\/10.1007\/s00224-011-9337-4","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,15]]}}}