Hitting and Covering Affine Families of Convex Polyhedra, with Applications to Robust Optimization

Jean Cardinal, Xavier Goaoc, Sarah Wajsbrot

Geometric hitting set problems, in which we seek a smallest set of points that collectively hit a given set of ranges, are ubiquitous in computational geometry. Most often, the set…