Abstract
We introduce a new class of problems: computing the set of all the convex combinations of sites when their position is uncertain and depends linearly on shared parameters which vary according to a uniform distribution. The boundary of the set, called the uncertainty envelope, is useful in optimizing processes where there is uncertainty on the site positions and the objective functions. We provide upper bounds on the combinatorial complexity of the uncertainty envelope, and present the first efficient algorithm for its computation in the general case.
| Original language | English |
|---|---|
| Title of host publication | 21st European Workshop on Computational Geometry (EuroCG) |
| Pages | 175-178 |
| Number of pages | 4 |
| State | Published - 2005 |
| Event | 21st European Workshop on Computational Geometry - Technische Universiteit Eindhoven, Eindhoven, Netherlands Duration: 9 Mar 2005 → 11 Mar 2005 Conference number: 21 https://www.win.tue.nl/EWCG2005/ |
Conference
| Conference | 21st European Workshop on Computational Geometry |
|---|---|
| Abbreviated title | EuroCG 2005 |
| Country/Territory | Netherlands |
| City | Eindhoven |
| Period | 9/03/05 → 11/03/05 |
| Internet address |