{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:56:43Z","timestamp":1772794603140,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,11,1]],"date-time":"1983-11-01T00:00:00Z","timestamp":436492800000},"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":["Computer Vision, Graphics, and Image Processing"],"published-print":{"date-parts":[[1983,11]]},"DOI":"10.1016\/0734-189x(83)90040-3","type":"journal-article","created":{"date-parts":[[2005,2,16]],"date-time":"2005-02-16T22:36:05Z","timestamp":1108593365000},"page":"131-159","source":"Crossref","is-referenced-by-count":38,"title":["Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition"],"prefix":"10.1016","volume":"24","author":[{"given":"Dov","family":"Dori","sequence":"first","affiliation":[]},{"given":"Moshe","family":"Ben-Bassat","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0734-189X(83)90040-3_BIB1","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","article-title":"A linear programming approach to the cutting stock problem","volume":"9","author":"Gilmore","year":"1961","journal-title":"Oper. Res."},{"key":"10.1016\/0734-189X(83)90040-3_BIB2","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/opre.13.1.94","article-title":"Multistage cutting problems of two and more dimensions","volume":"13","author":"Gilmore","year":"1965","journal-title":"Oper. Res."},{"key":"10.1016\/0734-189X(83)90040-3_BIB3","first-page":"1045","article-title":"The theory and computation of knapsack functions","volume":"15","author":"Gilmore","year":"1967","journal-title":"Oper. Res."},{"key":"10.1016\/0734-189X(83)90040-3_BIB4","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1287\/opre.25.1.30","article-title":"An algorithm for two dimensional cutting problems","volume":"25","author":"Christofides","year":"1977","journal-title":"Oper. Res."},{"issue":"7","key":"10.1016\/0734-189X(83)90040-3_BIB5","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1057\/jors.1978.148","article-title":"A note on the two dimensional rectangular cutting stock problem","volume":"29","author":"De Cani","year":"1978","journal-title":"J. Oper. Res. Soc. Amer."},{"key":"10.1016\/0734-189X(83)90040-3_BIB6","doi-asserted-by":"crossref","first-page":"839","DOI":"10.2307\/2314332","article-title":"On paving the plane","volume":"75","author":"Kershner","year":"1968","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0734-189X(83)90040-3_BIB7","series-title":"Mathematical Handbook of Formulas and Tables (Schaum's Outline Series)","author":"Spiegel","year":"1968"},{"key":"10.1016\/0734-189X(83)90040-3_BIB8","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1093\/comjnl\/23.4.338","article-title":"A heuristic solution of the rectangular cutting stock problem","volume":"23","author":"Albano","year":"1979","journal-title":"Comput. J."},{"key":"10.1016\/0734-189X(83)90040-3_BIB9","doi-asserted-by":"crossref","unstructured":"D. Dori and M. Ben-Bassat, Efficient nesting of congruent convex figures. Comm. Assoc. Comput. Mach., in press.","DOI":"10.1145\/357994.358022"},{"key":"10.1016\/0734-189X(83)90040-3_BIB10","article-title":"Fast Polygonal Approximation of Digitized Curves","author":"Sklansky","year":"1979","journal-title":"Pattern Recognition"},{"key":"10.1016\/0734-189X(83)90040-3_BIB11","series-title":"Proceedings, V. Symposium on Operations Research","article-title":"A linear-time algorithm that finds all local minima among triangles containing a given convex polygon","author":"Klee","year":"1980"},{"key":"10.1016\/0734-189X(83)90040-3_BIB12","first-page":"409","article-title":"Determining the minimum area encasing rectangle for an arbitrary closed curve","volume":"18","author":"Freeman","year":"1975","journal-title":"Comm. Assoc. Comput. Mach."},{"key":"10.1016\/0734-189X(83)90040-3_BIB13","series-title":"5th International Conference on Pattern Recognition","first-page":"1324","article-title":"Pattern recognition and geometrical complexity","author":"Toussaint","year":"1979"},{"key":"10.1016\/0734-189X(83)90040-3_BIB14","series-title":"Proceedings, 20th Symposium on Foundations of Computer Science","article-title":"On a general method of maximizing and minimizing among certain geometric problems","author":"Dobkin","year":"1979"},{"key":"10.1016\/0734-189X(83)90040-3_BIB15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0898-1221(82)90035-9","article-title":"On the computer generation of random convex hulls","volume":"8","author":"Devroye","year":"1982","journal-title":"Comput. Math. Appl."}],"container-title":["Computer Vision, Graphics, and Image Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0734189X83900403?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0734189X83900403?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T11:26:34Z","timestamp":1548674794000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0734189X83900403"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,11]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,11]]}},"alternative-id":["0734189X83900403"],"URL":"https:\/\/doi.org\/10.1016\/0734-189x(83)90040-3","relation":{},"ISSN":["0734-189X"],"issn-type":[{"value":"0734-189X","type":"print"}],"subject":[],"published":{"date-parts":[[1983,11]]}}}