{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T03:19:43Z","timestamp":1768447183058,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1987,3,1]],"date-time":"1987-03-01T00:00:00Z","timestamp":541555200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[1987,3]]},"DOI":"10.1007\/bf02187867","type":"journal-article","created":{"date-parts":[[2005,10,29]],"date-time":"2005-10-29T08:51:54Z","timestamp":1130575914000},"page":"9-31","source":"Crossref","is-referenced-by-count":99,"title":["Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams"],"prefix":"10.1007","volume":"2","author":[{"given":"Daniel","family":"Leven","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha","family":"Sharir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1987,3,1]]},"reference":[{"key":"BF02187867_CR1","doi-asserted-by":"crossref","unstructured":"L. P. Chew and R. L. Drysdale, Voronoi diagrams based on convex distance functions,Proceedings of the ACM Symposium on Computational Geometry, 235\u2013244, 1985.","DOI":"10.1145\/323233.323264"},{"key":"BF02187867_CR2","doi-asserted-by":"crossref","unstructured":"S. Fortune, A fast algorithm for polygon containment by translation,Proceedings of the 12th International Colloquium on Automata, Language and Programming, 189\u2013198, 1985.","DOI":"10.1007\/BFb0015744"},{"key":"BF02187867_CR3","doi-asserted-by":"crossref","unstructured":"L. Guibas, L. Ramshaw, and J. Stofi, A kinetic approach to computational geometry,Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, 100\u2013111, 1983.","DOI":"10.1109\/SFCS.1983.1"},{"key":"BF02187867_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 translational motion amidst polygonal obstacles,Discrete Comput. Geom. 1 (1986), 59\u201371.","journal-title":"Discrete Comput. Geom."},{"key":"BF02187867_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,Proceedings of the ACM Symposium on Computational Geometry, 75\u201380, 1985.","DOI":"10.1145\/323233.323244"},{"key":"BF02187867_CR6","doi-asserted-by":"crossref","unstructured":"D. Kirkpatrick, Efficient computation of continuous skeletons,Proceedings of the 20th Symposium on Foundations of Computer Science, 18\u201327, 1979.","DOI":"10.1109\/SFCS.1979.15"},{"key":"BF02187867_CR7","volume-title":"Convex Sets and Their Applications","author":"S. R. Lay","year":"1972","unstructured":"S. R. Lay,Convex Sets and Their Applications, Wiley, New York, 1972."},{"key":"BF02187867_CR8","unstructured":"D. Leven and M. Sharir, Intersection and proximity problems and Voronoi diagrams, inAdvances in Robotics, Vol. I (J. Schwartz and C. Yap, eds.), 1986."},{"key":"BF02187867_CR9","unstructured":"R. Livne and M. Sharir, On intersection of planar Jordan curves, Technical Report 153, Computer Science Department, Courant Institute, New York University, 1985."},{"key":"BF02187867_CR10","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0196-6774(85)90021-5","volume":"6","author":"C. \u00d3'D\u00fanlaing","year":"1985","unstructured":"C. \u00d3'D\u00fanlaing and C. K. Yap, A \u201cretraction\u201d method for planning the motion of a disk,J. Algorithms 6 (1985) 104\u2013111.","journal-title":"J. Algorithms"},{"key":"BF02187867_CR11","volume-title":"Computational geometry","author":"M. I. Shamos","year":"1978","unstructured":"M. I. Shamos, Computational geometry, Ph.D. dissertation, Yale University, New Haven, CT, 1978."},{"key":"BF02187867_CR12","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1137\/0214034","volume":"14","author":"M. Sharir","year":"1985","unstructured":"M. Sharir, Intersections and closest pair problems for a set of circular discs,SIAM J. Comput. 14 (1985), 448\u2013468.","journal-title":"SIAM J. Comput."},{"key":"BF02187867_CR13","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/cpa.3160360305","volume":"36","author":"J. T. Schwartz","year":"1983","unstructured":"J. T. Schwartz and M. Sharir, On the piano movers' problem: I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers,Comm. Pure Appl. Math. 36 (1983), 345\u2013398.","journal-title":"Comm. Pure Appl. Math."},{"key":"BF02187867_CR14","unstructured":"C. K. Yap, AnO(n logn) algorithm for the Voronoi diagram of a set of simple curve segments, Technical Report 161, Computer Science Department, Courant Institute, New York University, 1985."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187867.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02187867\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187867","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T15:21:57Z","timestamp":1586532117000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02187867"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,3]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,3]]}},"alternative-id":["BF02187867"],"URL":"https:\/\/doi.org\/10.1007\/bf02187867","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,3]]}}}