Linear algorithm to find the largest intriangles of a planar convex polygon

Presents a linear time algorithm to find the maximum area triangle enclosed in a planar convex region. The algorithm is based on inspecting a selected set of chords in a decreasing sequence of slopes and the number of chords so inspected is proportional to total number of vertices resulting in a linear time algorithm. Addresses the problem because of its importance in robotics, computational geometry and other research areas.