Before revision:  Previously, O(n\log n) time algorithms were known which are based on the technique for computing the minimum weight k-link path given in \mbox{%DIFAUXCMD kgon94,kgon95soda  By applying the new technique proposed in Jin's recent work for the dual problem of computing the maximum area triangle inside a convex polygon, we solve the problem at hand in O(n) time, thus justify Jin's claim that his technique may find applications in other polygonal inclusion problems.
After revision:  Previously, O(n\log n) time algorithms were known which are based on the technique for computing the minimum weight k-link path given in \mbox{%DIFAUXCMD kgon94,kgon95soda . By applying the new technique proposed in Jin's recent work for the dual problem of computing the maximum area triangle inside a convex polygon, we solve the problem at hand in O(n) time, thus justify Jin's claim that his technique may find applications in other polygonal inclusion problems.