Before revision:  Our algorithm is simple and easy to implement, and it computes all the locally maximal triangles  .
After revision:  Our algorithm is simple and easy to implement, and it computes all the locally maximal triangles . 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 .