On the Most Likely Convex Hull of Uncertain Points
hakan yıldız2013, Lecture Notes in Computer Science
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
Consider a set of d-dimensional points where the existence or the location of each point is determined by a probability distribution. The convex hull of this set is a random variable distributed over exponentially many choices. We are interested in finding the most likely convex hull, namely, the one with the maximum probability of occurrence. We investigate this problem under two natural models of uncertainty: the point (also called the tuple) model where each point (site) has a fixed position si but only exists with some probability πi, for 0 < πi ≤ 1, and the multipoint model where each point has multiple possible locations or it may not appear at all. We show that the most likely hull under the point model can be computed in O(n 3) time for n points in d = 2 dimensions, but it is NP-hard for d ≥ 3 dimensions. On the other hand, we show that the problem is NP-hard under the multipoint model even for d = 2 dimensions. We also present hardness results for approximating the probability of the most likely hull. While we focus on the most likely hull for concreteness, our results hold for other natural definitions of a probabilistic hull.
Related papers
Convex Hulls under Uncertainty
Lecture Notes in Computer Science, 2014
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 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 tradeo↵s 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.
On the Convex Hull of Random Points in a Polytope
Journal of Applied Probability, 1988
The convex hull of n points drawn independently from a uniform distribution on the interior of a d-dimensional polytope is investigated. It is shown that the expected number of vertices is O(log d–1 n) for any polytope, the expected number of vertices is Ω(log d–1 n) for any simple polytope, and the expected number of facets is O(log d–1 n) for any simple polytope. An algorithm is presented for constructing the convex hull of such sets of points in linear average time.
Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points
Discrete & Computational Geometry, 1997
This paper presents an algorithm and its probabilistic analysis for constructing the convex hull ofm given points in Rn, the n-dimensional Euclidean space. The algorithm under consideration combines the Gift-Wrapping concept with the so-called Throw-Away Principle (introduced by Aki and Toussaint [1 ] and later by Devroye [10]) for nonextremal points. The latter principle had been used for a convex-hull-construction algorithm in R 2 and for its probabilistic analysis in a recent paper by Borgwardt et al. . There, the considerations remained much simpler, because in R2 the construction of the convex hull essentially requires recognition of the extremal points and of their order only.
Approximating largest convex hulls for imprecise points
Journal of Discrete Algorithms, 2008
Assume that a set of imprecise points is given, where each point is specified by a region in which the point will lie. Such a region can be modelled as a circle, square, line segment, etc. We study the problem of maximising the area of the convex hull of such a set. We prove NP-hardness when the imprecise points are modelled as line segments, and give linear time approximation schemes for a variety of models, based on the core-set paradigm.
Hyperplane Separability and Convexity of Probabilistic Point Sets
2016
We describe an O(n^d) time algorithm for computing the exact probability that two d-dimensional probabilistic point sets are linearly separable, for any fixed d >= 2. A probabilistic point in d-space is the usual point, but with an associated (independent) probability of existence. We also show that the d-dimensional separability problem is equivalent to a (d+1)-dimensional convex hull membership problem, which asks for the probability that a query point lies inside the convex hull of n probabilistic points. Using this reduction, we improve the current best bound for the convex hull membership by a factor of n [Agarwal et al., ESA, 2014]. In addition, our algorithms can handle "input degeneracies" in which more than k+1 points may lie on a k-dimensional subspace, thus resolving an open problem in [Agarwal et al., ESA, 2014]. Finally, we prove lower bounds for the separability problem via a reduction from the k-SUM problem, which shows in particular that our O(n^2) algor...
On the expected weight of the theta graph on uncertain points
International Symposium on Algorithms and Computation, 2020
ARTICLE INFO Given a point set S ⊂ R d , the θ-graph of S is as follows: for each point s ∈ S, draw cones with apex at s and angle θ and connect s to the point in each cone such that the projection of the point on the bisector of the cone is the closest to s. One can define the θ-graph on an uncertain point set, i.e. a point set where each point s i exists with an independent probability π i ∈ (0, 1]. In this paper, we propose an algorithm that computes the expected weight of the θ-graph on a given uncertain point set. The proposed algorithm takes O(n 2 α(n 2 , n) 2d) time and O(n 2) space, where n is the number of points, d and θ are constants, and α is the inverse of the Ackermann's function.
Smoothed Analysis of the Expected Number of Maximal Points in Two Dimensions
arXiv (Cornell University), 2018
The Maximal points in a set S are those that aren't dominated by any other point in S. Such points arise in multiple application settings in which they are called by a variety of different names, e.g., maxima, Pareto optimums, skylines. Because of their ubiquity, there is a large literature on the expected number of maxima in a set S of n points chosen IID from some distribution. Most such results assume that the underlying distribution is uniform over some spatial region and strongly use this uniformity in their analysis. This work was initially motivated by the question of how this expected number changes if the input distribution is perturbed by random noise. More specifically, let B p denote the uniform distribution from the 2-d unit L p ball, δB q denote the 2-d L q-ball, of radius δ and B p + δB q be the convolution of the two distributions, i.e., a point v ∈ B p is reported with an error chosen from δB q. The question is how the expected number of maxima change as a function of δ. Although the original motivation is for small δ the problem is well defined for any δ and our analysis treats the general case. More specifically, we study, as a function of n, δ, the expected number of maximal points when the n points in S are chosen IID from distributions of the type B p + δB q where p, q ∈ {1, 2, ∞} for δ > 0 and also of the type B ∞ + δB q where q ∈ [1, ∞) for δ > 0.
Convex hull for intersections of random lines
Discrete Mathematics & Theoretical Computer Science
The problem of finding the convex hull of the intersection points of random lines was studied in Devroye and Toussaint, 1993 and Langerman, Golin and Steiger, 2002, and algorithms with expected linear time were found. We improve the previous results of the model in Devroye and Toussaint, 1993 by giving a universal algorithm for a wider range of distributions.
Few points to generate a random polytope
1997
A random polytope, K n , is the convex hull of n points chosen randomly, independently, and uniformly from a convex body K^R d. It is shown here that, with high probability, K n can be obtained by taking the convex hull of m = o(n) points chosen independently and uniformly from a small neighbourhood of the boundary of K.
Voronoi Diagrams and Convex Hulls of Random Moving Points
Discrete & Computational Geometry, 2000
This report considers the expected combinatorial complexity of the Euclidean Voronoi diagram and the convex hull of sets of n independent random points moving in unit time between two positions drawn independently from the same distribution in R d for fixed d ≥ 2 as n → ∞. It is proved that, when the source and destination distributions are the uniform distribution on the unit d-ball, these complexities are (n (d+1)/d) for the Voronoi diagram and O(n (d−1)/(d+1) log n) for the convex hull. Additional results for the convex hull are O(log d n) for the uniform distribution in the unit d-cube and O(log (d+1)/2 n) for the d-dimensional normal distribution.
Related topics
Related papers
On the convex hull of uniform random points in a simpled-polytope
Discrete & Computational Geometry, 1991
Denote the expected number of facets and vertices and the expected volume of the convex hull Pn of n random points, selected independently and uniformly from the interior of a simple d-polytope by En(f), E.(v), and E~(V), respectively. In this note we determine the sharp constants of the asymptotic expansion of En(f), E.(v), and En(V), as n tends to infinity. Further, some results concerning the expected shape of P~ are given.
Largest and Smallest Tours and Convex Hulls for Imprecise Points
Lecture Notes in Computer Science, 2006
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest possible convex hulls, measured by length and by area. Generally we assume the imprecision region to be a square, but we discuss the case where it is a segment or circle as well. We give polynomial time algorithms for several variants of this problem, ranging in running time from O(n log n) to O(n 13 ), and prove NP-hardness for some other variants. *
Containment and Evasion in Stochastic Point Data
Lecture Notes in Computer Science, 2016
Given two disjoint and finite point sets A and B in IR d , we say that B is contained in A if all the points of B lie within the convex hull of A, and that B evades A if no point of B lies inside the convex hull of A. We investigate the containment and evasion problems of this type when the set A is stochastic, meaning each of its points ai is present with an independent probability π(ai). Our model is motivated by situations in which there is uncertainty about the set A, for instance, due to randomized strategy of an adversarial agent or scheduling of monitoring sensors. Our main results include the following: (1) we can compute the exact probability of containment or evasion in two dimensions in worstcase O(n 3 (n + log m) + m 2) time and O(n 2 + m 2) space, where n = |A| and m = |B|, and (2) we prove that these problems are #P-hard in 3 or higher dimensions.
On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm
Journal of Algorithms, 1997
In this paper we present a truly practical and provably optimal O(n logh) time outputsensitive algorithm for the planar convex hull problem. The basic algorithm is similar to the algorithm presented in Chan, Snoeyink and Yap 2] where the median-nding step is replaced by an approximate median. We analyze two such schemes and show that for both methods, the algorithm runs in expected O(n log h) time. The expected number of comparisons can be made smaller than 5n logh for the upper-hull. We further show that the probability of deviation from expected running time approaches 0 rapidly with increasing values of n and h for any input. Our experiments suggest that this algorithm is a practical alternative to the worstcase O(n log n) algorithms like Graham's and especially faster for small output-sizes. Our approach bears some resemblance to a recent algorithm of Wenger 13] but our analysis is substantially di erent. The planar convex hull problem is perhaps the most studied problem in computational geometry and a large body of literature deals with computing convex hulls. Graham 5] was the rst to present an O(n log n) worst-case time algorithm. This algorithm is optimal as Yao 14] showed that (n log n) is the lower bound of the convex hull problem for the worst-case input. Some simple algorithms have O(n) expected time for known distributions of points such as uniform in a box, normal, etc. The rst output-sensitive algorithm was proposed by Chand and Kapur 3]. The two-dimensional version of their algorithm is known as the rope fence method and was independently reported by Jarvis 6]. The rope fence method takes O(nh) time to compute h extreme edges of the convex hull. Kirkpatrick and Seidel 8] proved an (n logh) lower bound when both input and output sizes are considered, so Yao's lower-bound is a special case when log h 2 (log n). They also proposed an O(n log h) optimal algorithm based on the prune-and-search technique developed by Dyer 4] and Megiddo 9]. However, it has high constants and is considered prohibitively complicated for implementation. Very recently, in 1], two O(n log h) algorithms have been proposed. One uses the linear-time median nding algorithm and the other uses a clever grouping technique. Although the latter algorithm does not have any expensive median-nding step it relies on a sophisticated logarithmic time tangent-nding routine.
Closest pair and the post office problem for stochastic points
Algorithms and Data Structures, 2011
Given a (master) set M of n points in d-dimensional Euclidean space, consider drawing a random subset that includes each point mi ∈ M with an independent probability pi. How difficult is it to compute elementary statistics about the closest pair of points in such a subset? For instance, what is the probability that the distance between the closest pair of points in the random subset is no more than , for a given value ? Or, can we preprocess the master set M such that given a query point q, we can efficiently estimate the expected distance from q to its nearest neighbor in the random subset? We obtain hardness results and approximation algorithms for stochastic problems of this kind.
Maximum Box Problem on Stochastic Points
Algorithmica, 2021
Given a finite set of weighted points in $${\mathbb {R}}^d$$ R d (where there can be negative weights), the maximum box problem asks for an axis-aligned rectangle (i.e., box) such that the sum of the weights of the points that it contains is maximized. We consider that each point of the input has a probability of being present in the final random point set, and these events are mutually independent; then, the total weight of a maximum box is a random variable. We aim to compute both the probability that this variable is at least a given parameter, and its expectation. We show that even in $$d=1$$ d = 1 these computations are #P-hard, and give pseudo-polynomial time algorithms in the case where the weights are integers in a bounded interval. For $$d=2$$ d = 2 , we consider that each point is colored red or blue, where red points have weight $$+1$$ + 1 and blue points weight $$-\infty $$ - ∞ . The random variable is the maximum number of red points that can be covered with a box not c...
Instance-optimal geometric algorithms
2009 50th Annual IEEE Symposium …, 2009
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for every algorithm A ′ in a certain class A, the maximum running time of A on input s 1 , . . . , s n is at most a constant factor times the maximum running time of A ′ on s 1 , . . . , s n , where the maximum is taken over all permutations s 1 , . . . , s n of S. In fact, we can establish a stronger property: for every S and A ′ , the maximum running time of A is at most a constant factor times the average running time of A ′ over all permutations of S. We call algorithms satisfying these properties instance-optimal in the order-oblivious and random-order setting. Such instance-optimal algorithms simultaneously subsume output-sensitive algorithms and distributiondependent average-case algorithms, and all algorithms that do not take advantage of the order of the input or that assume the input is given in a random order.
Random convex hulls in a product of balls
Probability Theory and Related Fields, 1990
The convex hull of a set of points sampled independently and uniformly from the Cartesian product of bails of various dimensions is investigated. Bounds on the asymptotic behavior of the expected combinatorial complexity, volume, and mean width are derived when 'the distribution is held fixed and the sample size approaches infinity. The expected combinatorial complexity and volume are found to depend (up to constant factors) only on the greatest dimension of any factor ball and the number of balls of that dimension. On the other hand, the expected mean width depends only on the number of balls and the dimensions of the product.
A New Approach to Polynomial-Time Generation of Random Points in Convex Bodies
1996
In this paper we describe a new method for proving the polynomial-time convergence of an algorithm for sampling (almost) uniformly at random from a convex body in high dimension. Previous approaches have been based on estimating conductance via isoperimetric inequalities. We show that a conceptually simpler coupling argument can be used to give a similar result.
Faster Algorithms for Computing Plurality Points
ACM Transactions on Algorithms, 2018
Let V be a set of n points in R d , which we call voters. A point p ∈ R d is preferred over another point p ′ ∈ R d by a voter υ ∈ V if dist(υ, p ) < dist(υ, p ′). A point p is called a plurality point if it is preferred by at least as many voters as any other point p ′. We present an algorithm that decides in O ( n log n ) time whether V admits a plurality point in the L 2 norm and, if so, finds the (unique) plurality point. We also give efficient algorithms to compute a minimum-cost subset W ⊂ V such that V \ W admits a plurality point, and to compute a so-called minimum-radius plurality ball. Finally, we consider the problem in the personalized L 1 norm, where each point υ ∈ V has a preference vector 〈 w 1 (υ),…, w d (υ)〉 and the distance from υ to any point p ∈ R d is given by ∑ i =1 d w i (υ)· | x i (υ)− x i ( p )|. For this case we can compute in O ( n d −1 ) time the set of all plurality points of V . When all preference vectors are equal, the running time improves to O ...
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.