{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T06:29:31Z","timestamp":1649140171998},"publisher-location":"Berlin\/Heidelberg","reference-count":20,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540139125","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0024019","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T05:44:22Z","timestamp":1132379062000},"page":"310-321","source":"Crossref","is-referenced-by-count":12,"title":["Translating polygons in the plane"],"prefix":"10.1007","author":[{"given":"J\u00f6rg-R.","family":"Sack","sequence":"first","affiliation":[]},{"given":"Godfried T.","family":"Toussaint","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"L.J. Guibas and F.F. Yao, \"On translating a set of rectangles\", Proc. 12th Annual ACM Symposium on Theory of Computing, 1980, pp. 154\u2013160.","DOI":"10.1145\/800141.804663"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"J.E. Hopcroft, D.A. Joseph and S.H. Whitesides. \"On the movement of robot arms in 2-dimensional bounded regions\", Tech. Rept. 82-486, Comp. Science Dept., Cornell Univ., March 1982. Also, Proceedings 23rd FOCS, 1982, pp. 280\u2013289.","DOI":"10.1109\/SFCS.1982.29"},{"key":"31_CR3","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","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. ACM 22 (1979), pp. 560\u2013570.","journal-title":"Comm. ACM"},{"key":"31_CR4","unstructured":"J. Reif, \"Complexity of the movers' problem and generalizations\", Proc. 20th Symp. on the Foundations of Computer Science (1979), pp. 421\u2013427."},{"key":"31_CR5","unstructured":"J.T. Schwartz and M. Sharir, \"On the piano movers' problem: I. The special case of a rigid polygonal body moving amidst polygonal Barriers\", to appear in Comm. Pure Appl. Math."},{"key":"31_CR6","unstructured":"J.T. Schwartz and M. Sharir, \"On the piano movers' problem: II. General techniques for computing topological properties of real algebraic manifolds\", to appear in Adv. Appl. Math."},{"key":"31_CR7","unstructured":"J.T. Schwartz and M. Sharir, \"On the piano movers' problem: III. Coordinating the motion of several independent bodies: The special case of circular bodies moving amidst polygonal barriers\", Tech. Rept., Courant Institute, N.Y.U., 1983."},{"key":"31_CR8","unstructured":"C.K. Yap, \"Motion coordination for two discs\", Tech. Rept. Courant Institute, N.Y.U., Jan. 1983."},{"key":"31_CR9","first-page":"681","volume":"SMC-11","author":"L. Tomas","year":"1981","unstructured":"Tomas Lozano-Perez, \"Automatic planning of manipulator transfer movements\", IEEE Trans. Syst., Man, Cybern., vol. SMC-11, pp. 681\u2013698, 1981.","journal-title":"IEEE Trans. Syst., Man, Cybern."},{"key":"31_CR10","unstructured":"Hans P. Moravec, \"Obstacle avoidance and navigation in the realworld by a seeing robot rover\", Standord Univ. Tech. Rept., AIM-340, Sept. 1980."},{"key":"31_CR11","unstructured":"Shriram M. Udupa, \"Collision detection and avoidance in computer controlled manipulators\", Proc. IJACI-5, MIT, Cambridge, MA., Aug. 1977, pp. 737\u2013748."},{"key":"31_CR12","unstructured":"C. Widdoes, \"A heuristic collision avoider for the Stanford robot arm\", Stanford CS Memo 227, June 1974."},{"key":"31_CR13","unstructured":"G.T. Toussaint, J.-R. Sack, \"Some new results on moving polygons in the plane\", Proc. Robotic Intelligence and Productivity Conference, Detroit, Mi, November 1983, pp. 158\u2013163."},{"key":"31_CR14","volume-title":"Computing the visibility polygon from an edge","author":"D.T. Lee","year":"1984","unstructured":"D.T. Lee, A. Lin, \"Computing the visibility polygon from an edge\", Northwestern University, Evanston, Ill., January 1984."},{"key":"31_CR15","unstructured":"H. ElGindy, \"An efficient algorithm for computing the weak visibility polygon from an edge in simple polygons (Preliminary version)\", McGill University, Montreal, Canada."},{"issue":"1","key":"31_CR16","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D. Kirkpatrick","year":"1983","unstructured":"D. Kirkpatrick, \"Optimal Search in planar subdivisions\", SIAM J. Comp., vol. 12, no. 1, February 1983, pp. 28\u201335.","journal-title":"SIAM J. Comp."},{"key":"31_CR17","volume-title":"Computational Geometry","author":"M. Shamos","year":"1978","unstructured":"M. Shamos, \"Computational Geometry\", Ph.D. thesis, Department of Computer Science, Yale University, NewHaven, CT., May 1978."},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"D. Avis, H. EdGindy, and R. Seidel, \"Simple on-line algorithms for convex polygons\", in Computational Geometry, Ed., G. T. Toussaint, North-Holland, 1985.","DOI":"10.1016\/B978-0-444-87806-9.50007-4"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"G. Toussaint, \"Movable separability of sets,\" in Computational Geometry, Ed., G. T. Toussaint, North-Holland, 1985.","DOI":"10.1016\/B978-0-444-87806-9.50018-9"},{"key":"31_CR20","unstructured":"S. Whiteside, \"Computational geometry and spatial planning\", in Computational Geometry, Ed., G. T. Toussaint, North-Holland, 1985."}],"container-title":["STACS 85","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024019.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:51:32Z","timestamp":1607550692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540139125"],"references-count":20,"URL":"http:\/\/dx.doi.org\/10.1007\/bfb0024019","relation":{}}}