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 .
After revision: Given a convex polygon P with n vertices, we show that all the maximal area triangles in P can be computed ], 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 .