Before revision: Given a convex polygon P with n vertices, we show that all the maximal area triangles in P can be computed ] in linear time . This settles the problem proposed by Keikha et. al. .
After revision: Given a convex polygon P with n vertices, we show that all the maximal area triangles in P can be computed ] 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 .