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 arXiv 1705.11035] in linear time .