{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:08:15Z","timestamp":1770743295336,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1986,6,1]],"date-time":"1986-06-01T00:00:00Z","timestamp":517968000000},"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":[[1986,6]]},"DOI":"10.1007\/bf02187692","type":"journal-article","created":{"date-parts":[[2005,9,20]],"date-time":"2005-09-20T18:09:34Z","timestamp":1127239774000},"page":"155-182","source":"Crossref","is-referenced-by-count":55,"title":["A polynomial solution for the potato-peeling problem"],"prefix":"10.1007","volume":"1","author":[{"given":"J. S.","family":"Chang","sequence":"first","affiliation":[]},{"given":"C. K.","family":"Yap","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1986,6,1]]},"reference":[{"key":"BF02187692_CR1","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, J. S. Chang, and C. K. Yap, Minimum area circumscribing polygons, to appear in a special issue of Visual Computer: International J. of Computer Graphics. Also, NYU-Courant Institute Robotics Lab. Report No. 42, May 1985.","DOI":"10.1007\/BF01898354"},{"key":"BF02187692_CR2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, D. Kozen, and J. Reif, The complexity of elementary algebra and geometry, 16th STOC, 457\u2013464, 1984.","DOI":"10.1145\/800057.808712"},{"key":"BF02187692_CR3","doi-asserted-by":"crossref","unstructured":"J. E. Boyce, D. P. Dobkin, III, R. L. Drysdale, and L J. Guibas, Finding extremal polygons, 14th STOC, 282\u2013289, 1982.","DOI":"10.1145\/800070.802202"},{"key":"BF02187692_CR4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.2307\/2688915","volume":"44","author":"G. D. Chakerian","year":"1971","unstructured":"G. D. Chakerian, and L. H. Lange, Geometric extremum problems, Math. Mag. 44 (1971) 57\u201369.","journal-title":"Math. Mag."},{"key":"BF02187692_CR5","doi-asserted-by":"crossref","unstructured":"J. S. Chang, and C. K. Yap, A polynomial solution to potato-peeling and other polygon inclusion and enclosure problems, 25th FOCS, 408\u2013416, May 1984.","DOI":"10.1109\/SFCS.1984.715942"},{"key":"BF02187692_CR6","doi-asserted-by":"crossref","unstructured":"B. Chazelle, R. L. Drysdale, and D. T. Lee, Computing the Largest Empty Rectangle, Proc. of the Symposium on Theoretic Aspects of Comp. Sci., Paris, April, 1984.","DOI":"10.1007\/3-540-12920-0_4"},{"key":"BF02187692_CR7","unstructured":"A. DePano, and A. Aggarwal, Finding restrictedK-envelopes for Convex Polygons, Proc. of the 22nd Allerton Conference on Comm. Control and Computing, 1984."},{"key":"BF02187692_CR8","unstructured":"A. Depano, Approximations of Polygons and Polyhedra: Potentials for Research, Manuscript, 1984."},{"key":"BF02187692_CR9","doi-asserted-by":"crossref","unstructured":"D. P. Dobkin and L. Snyder, On a general method for maximizing among certain geometric problems, 20th FOCS, 9\u201317, 1979.","DOI":"10.1109\/SFCS.1979.28"},{"key":"BF02187692_CR10","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0734-189X(83)90040-3","volume":"24","author":"D. Dori","year":"1983","unstructured":"D. Dori and M. Ben-Bassat, Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition, Computer Vision, Graphics and Image Processing 24 (1983) 131\u2013159.","journal-title":"Computer Vision, Graphics and Image Processing"},{"key":"BF02187692_CR11","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF00183192","volume":"11","author":"J. E. Goodman","year":"1981","unstructured":"J. E. Goodman, On the largest convex polygon contained in a non-convexn-gon, or How to peel a potato, Geometriae Dedicata 11 (1981) 99\u2013106.","journal-title":"Geometriae Dedicata"},{"key":"BF02187692_CR12","unstructured":"V. Klee and M. C. Laskowski, Finding the smallest triangles containing a given convex polygon, J. Algorithms, 457\u2013464, to appear."},{"key":"BF02187692_CR13","doi-asserted-by":"crossref","unstructured":"D. Kozen and C. K. Yap, Algebraic cell decomposition in NC, 26th FOCS, 1985.","DOI":"10.1109\/SFCS.1985.4"},{"key":"BF02187692_CR14","unstructured":"A. M. Lopshits, Computation of Areas of Oriented Figures, DC Heath, 1963."},{"key":"BF02187692_CR15","unstructured":"M. McKenna, J. O'Rourke, and S. Suri, Finding the Largest Rectangle in an Orthogonal Polygon, Tech. Report JHU\/EECS-85\/09, Dept. of Elec. Eng. and Comp. Sci., The Johns Hopkins University, 1985."},{"key":"BF02187692_CR16","unstructured":"J. O'Rourke, A. Aggarwal, S. Maddila, and M. Baldwin, An Optimal Algorithm for Finding Minimal Enclosing Triangles, Technical Report JHU\/EECS-84\/08, Dept. of Elec. Eng. and Comp. Sci., The Johns Hopkins University, May 1984."},{"key":"BF02187692_CR17","unstructured":"J. O'Rourke, Counterexamples to a Minimal Circumscription Algorithm, Manuscript, June 1984."},{"key":"BF02187692_CR18","unstructured":"J. O'Rourke, Finding Minimal Enclosing Boxes, Technical Report, Dept. of Elec. Eng. and Comp. Sci., The Johns Hopkins University, 1984."},{"key":"BF02187692_CR19","doi-asserted-by":"crossref","unstructured":"M. Sharir and A. Schorr, On shortest paths in polyhedral spaces, 16th STOC, 144\u2013153, 1984.","DOI":"10.1145\/800057.808676"},{"key":"BF02187692_CR20","unstructured":"G. T. Toussaint, Pattern Recognition and geometrical complexity, 5th International Conf. Pattern Recognition, 1324\u20131347 1979."},{"key":"BF02187692_CR21","unstructured":"T. Woo, The Convex Skull Problem, Manuscript, 1983."},{"key":"BF02187692_CR22","doi-asserted-by":"crossref","unstructured":"D. Wood and C. K. Yap, Computing a Convex Skull of an Orthogonal Polygon, Proc. of the Symposium on Computational Geometry, Baltimore, Maryland, 311\u2013316, June, 1985.","DOI":"10.1145\/323233.323273"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187692.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02187692\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187692","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T11:12:28Z","timestamp":1735989148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02187692"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,6]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,6]]}},"alternative-id":["BF02187692"],"URL":"https:\/\/doi.org\/10.1007\/bf02187692","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,6]]}}}