{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:30:35Z","timestamp":1787340635135,"version":"build-2736575974"},"reference-count":12,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,2]]},"abstract":"<jats:p>Given n points in the plane, we present algorithms for finding maximum perimeter or area convex k-gons with vertices k of the given n points. Our algorithms work in linear space and time $O(kn\\lg n + n\\lg ^2 n)$. For the special case $k = 3$ we give $O(n\\lg n)$ algorithms for these problems. Several related issues are discussed.<\/jats:p>","DOI":"10.1137\/0214011","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"134-147","source":"Crossref","is-referenced-by-count":55,"title":["Finding Extremal Polygons"],"prefix":"10.1137","volume":"14","author":[{"given":"James E.","family":"Boyce","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David P.","family":"Dobkin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert L. (Scot)","family":"Drysdale III","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leo J.","family":"Guibas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"RDL","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90054-0"},{"key":"RDS","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1979.28"},{"key":"RDM","unstructured":"D. P. Dobkin, I. Munro, personal communication"},{"key":"RDOS","first-page":"143","volume-title":"VLSI Systems and Computations","author":"Dolev D.","year":"1981"},{"key":"RG","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(72)90045-2"},{"key":"RHS","volume-title":"Fundamentals of computer algorithms","author":"Horowitz E.","year":"1978"},{"key":"RIB","volume-title":"Convex Figures","author":"Iaglom I. M.","year":"1961"},{"key":"RP","doi-asserted-by":"crossref","unstructured":"M. J. Post,  A minimum spanning ellipse algorithm,  Twenty-second Annual IEEE Symposium on the Foundations of Computer Science,  1981,  115\u201322","DOI":"10.1109\/SFCS.1981.7"},{"key":"RS","volume-title":"Integral geometry and geometric probability","author":"Santalo L. A.","year":"1976"},{"key":"RSB","unstructured":"M. I. Shamos,  Problems in Computational Geometry,  1974, unpublished manuscript, June, revised May 1975, Feb. 1977"},{"key":"RYA","unstructured":"A. C. Yao,  Fast algorithms for minimum spanning trees in  k dimensions,  Fifteenth Annual Allerton Conference on Communication Control and Computing,  1977,  553\u2013556, Sept."},{"key":"RYF","doi-asserted-by":"crossref","unstructured":"F. F. Yao,  Efficient dynamic programming using quadrangle inequalities,  Twelfth ACM Symposium on the Theory of Computation,  1980,  429\u2013435","DOI":"10.1145\/800141.804691"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214011","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:42:17Z","timestamp":1787337737000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,2]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,2]]}},"alternative-id":["10.1137\/0214011"],"URL":"https:\/\/doi.org\/10.1137\/0214011","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,2]]}}}