Convex Hulls under Uncertainty

Abstract

We study the convex-hull problem in a probabilistic setting, motivated by the need to handle data uncertainty inherent in many applications, including sensor databases, location-based services and computer vision. In our framework, the uncertainty of each input site is described by a probability distribution over a finite number of possible locations including a \emph{null} location to account for non-existence of the point. Our results include both exact and approximation algorithms for computing the probability of a query point lying inside the convex hull of the input, time-space tradeoffs for the membership queries, a connection between Tukey depth and membership queries, as well as a new notion of $\some$-hull that may be a useful representation of uncertain hulls.

Cited by in corpus (5)

• Stochastic closest-pair problem and most-likely nearest-neighbor search in tree spaces
• On Dominance-Free Samples of a (Colored) Stochastic Dataset
• Computing the Rectilinear Center of Uncertain Points in the Plane
• Computing the Expected Value and Variance of Geometric Measures
• Covering Uncertain Points in a Tree