In arXiv 1705.11035%DIFDELCMD < ]%%% , the widely known linear time algorithm for computing the maximum area triangle in a convex polygon was found incorrect by Keikha et. al. , and whether it can still be solved in linear time was proposed as an open problem. We resolved it affirmatively by presenting a new linear time algorithm . Our algorithm is simple and easy to implement, and it computes all the locally maximal triangles  .
 %DIFDELCMD < ]%%% 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 .
D
In
D
arXiv 1705.11035
R
, the
The
R
, and whether it can still be solved in linear time was proposed as an open problem. We resolved it affirmatively by presenting a new linear time algorithm . Our algorithm is simple and easy to implement, and it computes all the locally maximal triangles
arXiv 1705.11035
A
. 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