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 is powerful in solving other related problems.
The widely known linear time algorithm for computing the maximum area triangle in a convex polygon was found incorrect recently 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. More importantly, our new approach is powerful in solving related problems.
A
recently
R
\ al
al.(
A
)
R
Moreover, it can be easily extended to compute the minimum area triangle enclosing a convex polygon. Also,
More importantly,
D
other