An algorithm is described to determine the minimum area polar set of a
planar convex polygon described in terms of its vertices. We adopt a
result due to Santalo to verify our minimizing solution, and then demo
nstrate the search procedure on a few examples.