{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T08:40:21Z","timestamp":1787388021494,"version":"build-2736575974"},"reference-count":19,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7168,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1016\/0925-7721(93)90007-s","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:41:31Z","timestamp":1027640491000},"page":"353-373","source":"Crossref","is-referenced-by-count":48,"title":["The complexity of the free space for a robot moving amidst fat obstacles"],"prefix":"10.1016","volume":"3","author":[{"given":"A.Frank","family":"van der Stappen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dan","family":"Halperin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark H.","family":"Overmars","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(93)90007-S_BIB1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/BF01758853","article-title":"Approximate motion planning and the complexity of the boundary of the union of simple geometric figures","volume":"8","author":"Alt","year":"1992","journal-title":"Algoritmica"},{"key":"10.1016\/0925-7721(93)90007-S_BIB2","doi-asserted-by":"crossref","DOI":"10.1109\/ROBOT.1988.12304","article-title":"A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles","author":"Avnaim","year":"1988"},{"key":"10.1016\/0925-7721(93)90007-S_BIB3","volume":"Vol. II","author":"Fikhtengol'ts","year":"1965"},{"key":"10.1016\/0925-7721(93)90007-S_BIB4","doi-asserted-by":"crossref","unstructured":"L. Guibas and M. Sharir, Combinatorics and algorithms of arrangements, in: J. Pach, ed., New Trends in Discrete and Computational Geometry, to appear.","DOI":"10.1007\/978-3-642-58043-7_2"},{"key":"10.1016\/0925-7721(93)90007-S_BIB5","article-title":"Algorithmic motion planning via arrangements of curves and of surfaces","author":"Halperin","year":"1992"},{"key":"10.1016\/0925-7721(93)90007-S_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0221001","article-title":"Efficient motion planning for an L-shaped object","volume":"21","author":"Halperin","year":"1992","journal-title":"SIAM J. Comput"},{"key":"10.1016\/0925-7721(93)90007-S_BIB7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02187779","article-title":"An efficient motion-planning algorithm for a convex rigid polygonal object in two-dimensional polygonal space","volume":"5","author":"Kedem","year":"1990","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(93)90007-S_BIB8","author":"Latombe","year":"1991"},{"key":"10.1016\/0925-7721(93)90007-S_BIB9","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/0196-6774(87)90038-1","article-title":"An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers","volume":"8","author":"Leven","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(93)90007-S_BIB10","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF02187883","article-title":"On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space","volume":"2","author":"Leven","year":"1987","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(93)90007-S_BIB11","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1109\/SFCS.1991.185347","article-title":"Fat triangles determine linearly many holes","author":"Matou\u0161ek","year":"1991","journal-title":"Prox. 32nd IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0925-7721(93)90007-S_BIB12","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0196-6774(85)90021-5","article-title":"A \u201cretraction\u201d method for planning the motion of a disc","volume":"6","author":"\u00d3'D\u00fanlaing","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(93)90007-S_BIB13","first-page":"207","article-title":"Retraction: a new approach to motion planning","author":"\u00d3'D\u00fanlaing","year":"1983","journal-title":"Proc. 15th ACM Symp. on the Theory of Computing"},{"key":"10.1016\/0925-7721(93)90007-S_BIB14","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0020-0190(92)90211-D","article-title":"Point location in fat subdivisions","volume":"44","author":"Overmars","year":"1992","journal-title":"Inform. Proc. Lett."},{"key":"10.1016\/0925-7721(93)90007-S_BIB15","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/cpa.3160360305","article-title":"On the piano movers' problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal boundaries","volume":"36","author":"Schwartz","year":"1983","journal-title":"Comm. Pure Appl. Math."},{"key":"10.1016\/0925-7721(93)90007-S_BIB16","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/2.16221","article-title":"Algorithmic motion planning in robotics","volume":"22","author":"Sharir","year":"1989","journal-title":"Comput."},{"key":"10.1016\/0925-7721(93)90007-S_BIB17","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01840368","article-title":"A new efficient motion planning algorithm for a rod in two-dimensional polygonal space","volume":"2","author":"Sifrony","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0925-7721(93)90007-S_BIB18","unstructured":"A.F. van der Stappen and M.H. Overmars, A paradigm for efficient motion planning amidst fat obstacles, in preparation."},{"key":"10.1016\/0925-7721(93)90007-S_BIB19","first-page":"95","article-title":"Algorithmic motion planning","volume":"Vol. I","author":"Yap","year":"1987"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219390007S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219390007S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:56:05Z","timestamp":1555124165000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/092577219390007S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["092577219390007S"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(93)90007-s","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}