Before revision: In arXiv 1705.11035 , 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  .
After revision: In arXiv 1705.11035 , 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 .