Papers › Estimating the Convex Hull of the Image of a Set with Smooth Boundary: Error Bounds...
Estimating the Convex Hull of the Image of a Set with Smooth Boundary: Error Bounds and Applications
Thomas Lew, Riccardo Bonalli, Lucas Janson, Marco Pavone
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We study the problem of estimating the convex hull of the image f(X)⊂ℝⁿ of a compact set X⊂ℝᵐ with smooth boundary through a smooth function f:ℝᵐ→ℝⁿ. 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(xᵢ) of M sampled inputs xᵢ 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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections