Maximal Area Triangles in a Convex Polygon

07/13/2017

∙

by   Kai Jin, et al.

∙

0

∙

share

The widely known linear time algorithm for computing the maximum area triangle in a convex polygon was found incorrect by Keikha et. al. [arXiv 1705.11035]. We present an alternative algorithm in this paper. Comparing to the only previously known correct solution, ours is much simpler and more efficient. Moreover, it can be easily extended to compute the minimum area triangle enclosing a convex polygon. Also, our new approach seems powerful in solving other related problems.