Estimating the Convex Hull of the Image of a Set with Smooth Boundary: Error Bounds and Applications
Abstract
We study the problem of estimating the convex hull of the image f(X)⊂Rn of a compact set X⊂Rm with smooth boundary through a smooth function f:Rmn. Assuming that f is a submersion, we derive a new bound on the Hausdorff distance between the convex hull of f(X) and the convex hull of the images f(xi) of M sampled inputs xi on the boundary of X. When applied to the problem of geometric inference from a random sample, our results give error bounds that are tighter and more general than in previous work. We present applications to the problems of robust optimization, of reachability analysis of dynamical systems, and of robust trajectory optimization under bounded uncertainty.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.