I need a code to calculate the largest simple convex polygon that is
entirely contained within a given simple polygon (which may be
concave).  The resulting polygon need not be made up solely of vertices from
the original polygon.  If there it no unique largest polygon, it
doesn't matter which of the largest is returned.  The code needs to be
in C++, C#, VB.NET or Java (preferably not Java) and should take and
return an array of XY coordinates representing the polygons.