{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T01:46:30Z","timestamp":1726451190925},"reference-count":10,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1986,12]]},"DOI":"10.1016\/0196-6774(86)90017-9","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"532-548","source":"Crossref","is-referenced-by-count":22,"title":["Polygon containment under translation"],"prefix":"10.1016","volume":"7","author":[{"given":"B.S","family":"Baker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.J","family":"Fortune","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.R","family":"Mahaney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1975","author":"Aho","series-title":"The Design and Analysis of Computer Algorithms","key":"10.1016\/0196-6774(86)90017-9_BIB1"},{"unstructured":"B. Chazelle, \u201cThe Polygon Containment Problem,\u201d Advances of Computing Research, Vol. 1, pp. 1\u201333, JAI Press, Greenwich, Conn.","key":"10.1016\/0196-6774(86)90017-9_BIB2"},{"key":"10.1016\/0196-6774(86)90017-9_BIB3","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","article-title":"Algorithms for reporting and counting geometric intersections","volume":"28","author":"Bentley","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0196-6774(86)90017-9_BIB4","series-title":"Proceedings of the Seventh Annual ACM Symposium on Theory of Computing","first-page":"224","article-title":"Geometric Complexity","author":"Shamos","year":"1975"},{"key":"10.1016\/0196-6774(86)90017-9_BIB5","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/0196-6774(83)90013-5","article-title":"Finding the Convex Hull of a Simple Polygon","volume":"4","author":"Graham","year":"1983","journal-title":"J. Algorithms"},{"year":"1984","author":"Schaffer","series-title":"Convex hulls of piece-wise smooth Jordan curves","key":"10.1016\/0196-6774(86)90017-9_BIB6"},{"key":"10.1016\/0196-6774(86)90017-9_BIB7","series-title":"Proceedings of the 23rd Annual Symposium on Foundations of Computer Science","first-page":"339","article-title":"A Theorem on Polygon Cutting with Applications","author":"Chzelle","year":"1982"},{"issue":"10","key":"10.1016\/0196-6774(86)90017-9_BIB8","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1145\/358656.358681","article-title":"Plane-sweep algorithms for intersecting geometric figures","volume":"25","author":"Nievergelt","year":"1982","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(86)90017-9_BIB9","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","article-title":"An algorithm for planning collision-free paths among polyhedral obstacles","volume":"22","author":"Lozano-Perez","year":"1979","journal-title":"Comm. ACM"},{"year":"1968","author":"Liu","series-title":"Introduction to Combinatorial Mathematics","key":"10.1016\/0196-6774(86)90017-9_BIB10"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677486900179?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677486900179?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:25:11Z","timestamp":1548725111000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677486900179"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,12]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1986,12]]}},"alternative-id":["0196677486900179"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(86)90017-9","relation":{},"ISSN":["0196-6774"],"issn-type":[{"type":"print","value":"0196-6774"}],"subject":[],"published":{"date-parts":[[1986,12]]}}}