Estimating the Convex Hull of the Image of a Set with Smooth Boundary: Error Bounds and Applications
Not on the map. Why?
Abstract (arXiv)
We study the problem of estimating the convex hull of the image f(X)subsetℝn of a compact set Xsubsetℝm with smooth boundary through a smooth function f:ℝm→ℝn. 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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 27 Feb 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1.
1 paper.
- 2023Convex Hulls of Reachable Setscited by 0
- 2023Convex Hulls of Reachable Sets30 Mar 2023