{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T19:23:47Z","timestamp":1700594627302},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1016\/s0305-0548(96)00050-0","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"231-251","source":"Crossref","is-referenced-by-count":6,"title":["A new algorithm for the two-polygon containment problem"],"prefix":"10.1016","volume":"24","author":[{"given":"Roger B.","family":"Grinde","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom M.","family":"Cavalier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0305-0548(96)00050-0_BIB1","doi-asserted-by":"crossref","first-page":"8","DOI":"10.5957\/jsp.1986.2.1.8","article-title":"Nesting and marking of ship parts from steel plate","volume":"2","author":"Hooper","year":"1986","journal-title":"J. Ship Prod."},{"key":"10.1016\/S0305-0548(96)00050-0_BIB2","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1016\/0377-2217(95)00019-M","article-title":"Solution approaches to irregular nestings problems","volume":"84","author":"Dowsland","year":"1995","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/S0305-0548(96)00050-0_BIB3","series-title":"Computational Geometry, An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/S0305-0548(96)00050-0_BIB4","first-page":"151","article-title":"A fast algorithm for polygon containment by translation","volume":"194","author":"Fortune","year":"1985","journal-title":"Lecture Notes in Comp. Sci."},{"key":"10.1016\/S0305-0548(96)00050-0_BIB5","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1016\/0196-6774(86)90017-9","article-title":"Polygon containment under translation","volume":"7","author":"Baker","year":"1986","journal-title":"J. Algorithms"},{"issue":"4","key":"10.1016\/S0305-0548(96)00050-0_BIB6","first-page":"486","article-title":"Monotone polygon containment problems under translation","volume":"13","author":"Chiu","year":"1990","journal-title":"J. Info. Proc."},{"key":"10.1016\/S0305-0548(96)00050-0_BIB7","first-page":"1","article-title":"The polygon containment problem","volume":"Vol. 1","author":"Chazelle","year":"1983"},{"issue":"9","key":"10.1016\/S0305-0548(96)00050-0_BIB8","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1016\/0010-4485(88)90040-1","article-title":"Putting objects into boxes","volume":"20","author":"Martin","year":"1988","journal-title":"Comp. Aided Design"},{"issue":"1","key":"10.1016\/S0305-0548(96)00050-0_BIB9","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1051\/ita\/1989230100051","article-title":"Polygon placement under translation and rotation","volume":"23","author":"Avnaim","year":"1989","journal-title":"Theoretical Info. Appl."},{"key":"10.1016\/S0305-0548(96)00050-0_BIB10","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1016\/0377-2217(94)00279-7","article-title":"Containment of a single polygon using mathematical programming","volume":"92","author":"Grinde","year":"1996","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/S0305-0548(96)00050-0_BIB11","series-title":"Proc. 3rd Annual Symp. on Comp. Geometry","first-page":"242","article-title":"Simultaneous containment of several polygons","author":"Avnaim","year":"1987"},{"key":"10.1016\/S0305-0548(96)00050-0_BIB12","series-title":"24th Ann. Symp. Foundations Comp. Sci.","first-page":"100","article-title":"A kinetic framework for computational geometry (extended abstract)","author":"Guibas","year":"1983"},{"key":"10.1016\/S0305-0548(96)00050-0_BIB13","doi-asserted-by":"crossref","unstructured":"Daniels, K. and Milenkovic, V., Multiple translational containment, Part I: an approximate algorithm. Algorithmica, in preparation.","DOI":"10.1007\/PL00014415"},{"key":"10.1016\/S0305-0548(96)00050-0_BIB14","doi-asserted-by":"crossref","unstructured":"Milenkovic, V., Multiple translational containment, Part II: exact algorithms. Algorithmica, in preparation.","DOI":"10.1007\/PL00014416"},{"key":"10.1016\/S0305-0548(96)00050-0_BIB15","article-title":"Polygon containment and nesting: an optimization-based approach","author":"Grinde","year":"1993"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000500?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000500?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T16:41:27Z","timestamp":1621010487000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054896000500"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0305054896000500"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(96)00050-0","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}