Uncertainty envelopes.

Yaron Ostrovsky-Berman, Leo Joskowicz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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 languageEnglish
Title of host publication21st European Workshop on Computational Geometry (EuroCG)
Number of pages4
StatePublished - 2005
Event21st European Workshop on Computational Geometry - Technische Universiteit Eindhoven, Eindhoven, Netherlands
Duration: 9 Mar 200511 Mar 2005
Conference number: 21


Conference21st European Workshop on Computational Geometry
Abbreviated titleEuroCG 2005
Internet address


Dive into the research topics of 'Uncertainty envelopes.'. Together they form a unique fingerprint.

Cite this