{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T19:50:10Z","timestamp":1694634610771},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Robot. Automat."],"published-print":{"date-parts":[[1987,6]]},"DOI":"10.1109\/jra.1987.1087092","type":"journal-article","created":{"date-parts":[[2009,1,20]],"date-time":"2009-01-20T20:03:32Z","timestamp":1232481812000},"page":"182-193","source":"Crossref","is-referenced-by-count":13,"title":["Minimizing turns for discrete movement in the interior of a polygon"],"prefix":"10.1109","volume":"3","author":[{"given":"J.","family":"Reif","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Storer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/0212002"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/0206043"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.6"},{"key":"ref13","author":"niedringhaus","year":"1979","journal-title":"Scheduling without queueing The space factory problem"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/800263.809305"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/0210035"},{"key":"ref16","author":"reif","year":"1985","journal-title":"Shortest paths in Euclidean space with polyhedral obstacles"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/6138.6151"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/800116.803772"},{"key":"ref19","author":"shamos","year":"1978","journal-title":"Computational Geometry"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/0216045"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676494"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1090\/S0002-9939-1953-0058996-7","article-title":"Minimal sets of visibility","volume":"4","author":"valentine","year":"1953","journal-title":"Proc Amer Math Soc"},{"key":"ref3","author":"berge","year":"1976","journal-title":"Graphs and Hypergraphs"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0205015"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/323233.323252"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90062-5"},{"key":"ref7","author":"elgindy","year":"1985","journal-title":"Hierarchical decomposition of polygons with applications"},{"key":"ref2","author":"avis","year":"1980","journal-title":"An optimal algorithm for determining the visibility of a polygon from an edge"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/10515.10516"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.65"},{"key":"ref20","author":"suri","year":"1985","journal-title":"Finding minimum link paths inside a simple polygon"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0734-189X(86)90127-1"},{"key":"ref21","author":"suri","year":"1985","journal-title":"Finding minimum link paths inside a simple polygon"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140202"},{"key":"ref23","author":"suri","year":"1985","journal-title":"Worst-case optimal algorithms for constructing visibility polygons with holes"},{"key":"ref26","article-title":"Linear-time algorithm for triangulating simple polygons","author":"targan","year":"1985","journal-title":"18th Annu ACM Symp on the Theory of Computing"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/0216030"}],"container-title":["IEEE Journal on Robotics and Automation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/56\/23637\/01087092.pdf?arnumber=1087092","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:26:31Z","timestamp":1638217591000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1087092\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":28,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/jra.1987.1087092","relation":{},"ISSN":["0882-4967"],"issn-type":[{"value":"0882-4967","type":"print"}],"subject":[],"published":{"date-parts":[[1987,6]]}}}