Convex hulls under uncertainty

26Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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 point is described by a probability distribution over a finite number of possible locations including a 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 β-hull that may be a useful representation of uncertain hulls. © 2014 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Agarwal, P. K., Har-Peled, S., Suri, S., YIldIz, H., & Zhang, W. (2014). Convex hulls under uncertainty. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8737 LNCS, pp. 37–48). Springer Verlag. https://doi.org/10.1007/978-3-662-44777-2_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free