An optimal algorithm for finding minimal enclosing triangles
Joseph O’Rourke, Alok Aggarwal, Sanjeev Rao Maddila, Michael L. Baldwin · Journal of Algorithms · 1986
Klee and Laskowski's O(n log2n) algorithm for finding all minimal area triangles enclosing a given convex polygon of n vertices is improved to Θ(n), which is shown to be optimal both for finding all minima and for finding just one.