Thomas Lew, Riccardo Bonalli, Lucas Janson, Marco Pavone
{"title":"Estimating the Convex Hull of the Image of a Set with Smooth Boundary: Error Bounds and Applications","authors":"Thomas Lew, Riccardo Bonalli, Lucas Janson, Marco Pavone","doi":"10.1007/s00454-024-00683-5","DOIUrl":null,"url":null,"abstract":"<p>We study the problem of estimating the convex hull of the image <span>\\(f(X)\\subset {\\mathbb {R}}^n\\)</span> of a compact set <span>\\(X\\subset {\\mathbb {R}}^m\\)</span> with smooth boundary through a smooth function <span>\\(f:{\\mathbb {R}}^m\\rightarrow {\\mathbb {R}}^n\\)</span>. Assuming that <i>f</i> is a submersion, we derive a new bound on the Hausdorff distance between the convex hull of <i>f</i>(<i>X</i>) and the convex hull of the images <span>\\(f(x_i)\\)</span> of <i>M</i> sampled inputs <span>\\(x_i\\)</span> on the boundary of <i>X</i>. 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.</p>","PeriodicalId":50574,"journal":{"name":"Discrete & Computational Geometry","volume":"2 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete & Computational Geometry","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00454-024-00683-5","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
We study the problem of estimating the convex hull of the image \(f(X)\subset {\mathbb {R}}^n\) of a compact set \(X\subset {\mathbb {R}}^m\) with smooth boundary through a smooth function \(f:{\mathbb {R}}^m\rightarrow {\mathbb {R}}^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(x_i)\) of M sampled inputs \(x_i\) 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.
期刊介绍:
Discrete & Computational Geometry (DCG) is an international journal of mathematics and computer science, covering a broad range of topics in which geometry plays a fundamental role. It publishes papers on such topics as configurations and arrangements, spatial subdivision, packing, covering, and tiling, geometric complexity, polytopes, point location, geometric probability, geometric range searching, combinatorial and computational topology, probabilistic techniques in computational geometry, geometric graphs, geometry of numbers, and motion planning.