The inpolygon with minimal area and the cirenmpolygon

Abstract
Using necessary optimality conditions two different geometrical extremal problems can be formulated as one and the same discrete control problem. This last problem allows a very simple solution by dynamic programming methods