{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,3]],"date-time":"2023-05-03T12:10:07Z","timestamp":1683115807333},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1-6","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1007\/bf01758853","type":"journal-article","created":{"date-parts":[[2005,6,16]],"date-time":"2005-06-16T10:37:44Z","timestamp":1118918264000},"page":"391-406","source":"Crossref","is-referenced-by-count":29,"title":["Approximate motion planning and the complexity of the boundary of the union of simple geometric figures"],"prefix":"10.1007","volume":"8","author":[{"given":"Helmut","family":"Alt","sequence":"first","affiliation":[]},{"given":"Rudolf","family":"Fleischer","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"N\u00e4her","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Schirra","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Uhrig","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01758853_CR1","doi-asserted-by":"crossref","unstructured":"L. P. Chew and K. Kedem, High-Clearance Motion Planning for a Convex Polygon among Polygonal Obstacles, Technical Report No. 184\/90, Tel Aviv University (1990).","DOI":"10.1145\/73833.73853"},{"key":"BF01758853_CR2","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1137\/0215023","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner, L. Guibas, and J. Stolfi, Optimal Point Location in a Monotone Subdivision,SIAM J. Comput. 15 (1986), 317\u2013340.","journal-title":"SIAM J. Comput."},{"key":"BF01758853_CR3","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/BF02187744","volume":"4","author":"L. Guibas","year":"1988","unstructured":"L. Guibas, M. Sharir, and S. Sifrony, On the General Motion Planning Problem with Two Degrees of Freedom,Discrete Comput. Geom. 4 (1988), 491\u2013521.","journal-title":"Discrete Comput. Geom."},{"key":"BF01758853_CR4","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 Motion Amidst Polygonal Obstacles,Discrete Comput. Geom. 1 (1986), 59\u201371.","journal-title":"Discrete Comput. Geom."},{"key":"BF01758853_CR5","doi-asserted-by":"crossref","unstructured":"K. Kedem and M. Sharir, An Efficient Algorithm for Planning Collision-free Translational Motion of a Convex Polygonal Object in 2-dimensional Space Amidst Polygonal Obstacles,Proc. First ACM Symp. on Computational Geometry, 1985, pp. 75\u201380.","DOI":"10.1145\/323233.323244"},{"key":"BF01758853_CR6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02187779","volume":"5","author":"K. Kedem","year":"1990","unstructured":"K. Kedem and M. Sharir, An Efficient Motion-Planning Algorithm for a Convex Polygonal Object in Two-Dimensional Polygonal Space,Discrete Comput. Geom. 5 (1990), 43\u201375.","journal-title":"Discrete Comput. Geom."},{"key":"BF01758853_CR7","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02187867","volume":"2","author":"D. Leven","year":"1987","unstructured":"D. Leven and M. Sharir, Planning a Purely Translational Motion for a Convex Object in Two-Dimensional Space Using Generalized Voronoi Diagrams,Discrete Comput. Geom. 2 (1987), 9\u201331.","journal-title":"Discrete Comput. Geom."},{"key":"BF01758853_CR8","series-title":"Technical Report No. 153, Robotics Report No.","volume-title":"On Intersection of Planar Jordan Curves","author":"R. Livne","year":"1985","unstructured":"R. Livne and M. Sharir, On Intersection of Planar Jordan Curves, Technical Report No. 153, Robotics Report No. 37, Courant Institute, New York (1985)."},{"key":"BF01758853_CR9","first-page":"560","volume":"22","author":"T. Lozano-Perez","year":"1979","unstructured":"T. Lozano-Perez and M. Wesley, An Algorithm for Planning Collision-free Paths Among Polyhedral Obstacles,Comm. Assoc. Comput. Mach. 22 (1979), 560\u2013570.","journal-title":"Comm. Assoc. Comput. Mach."},{"key":"BF01758853_CR10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/978-3-642-83539-1_9","volume-title":"Theoretical Foundations of Computer Graphics and CAD","author":"M. Sharir","year":"1988","unstructured":"M. Sharir, Davenport-Schinzel Sequences and Their Geometric Applications,Theoretical Foundations of Computer Graphics and CAD (edited by R. A. Earnshaw), Springer-Verlag, Berlin, 1988, pp. 253\u2013272."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01758853.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01758853\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01758853","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,3]],"date-time":"2023-05-03T11:50:37Z","timestamp":1683114637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01758853"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":10,"journal-issue":{"issue":"1-6","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["BF01758853"],"URL":"https:\/\/doi.org\/10.1007\/bf01758853","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}