@inproceedings{142aaab0a5004570b7a48e2ac2cd7ee4,

title = "Finding extremal polygons",

abstract = "Given n points in the plane, we present algorithms for rinding 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 lgn + n lg2n). For the special case k = 3 we give O(n lg n) algorithms for these problems. Several related issues arc discussed.",

author = "Boyce, {James E.} and Dobkin, {David P.} and Drysdale, {Robert L.} and Guibas, {Leo J.}",

note = "Funding Information: Stanford University,s upported by NSF grant MCS 77-23738 Princeton University,v isitinga t Xerox PARC Dartmouth College, visiting at Xerox PARC and supported by NSF grant MCS 77-05313 Xerox PARC Funding Information: Stanford University, supported by NSF grant MCS 77-23738; 14th Annual ACM Symposium on Theory of Computing, STOC 1982 ; Conference date: 05-05-1982 Through 07-05-1982",

year = "1982",

month = may,

day = "5",

doi = "10.1145/800070.802202",

language = "English (US)",

isbn = "0897910702",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "282--289",

booktitle = "Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982",

}