Finding a hausdorff core of a polygon: On convex polygon containment with bounded Hausdorff distance

Abstract

Given a simple polygon P, we consider the problem of finding a convex polygon Q contained in P that minimizes H(P,Q), where H denotes the Hausdorff distance. We call such a polygon Q a Hausdorff core of P. We describe polynomial-time approximations for both the minimization and decision versions of the Hausdorff core problem, and we provide an argument supporting the hardness of the problem. © 2009 Springer Berlin Heidelberg.