The problem of locating a convex object in a polygon so that
the minimum distance between these two is maximized is discusses.
Under this criterion, the convex object is located near the
center of the polygon.  Algorithms using dynamic Voronoi diagrams
are given.