On the expected diameter, width, and complexity of a stochastic convex hull

We investigate several computational problems related to the stochastic convex hull (SCH). Given a stochastic dataset consisting of n points in \(\mathbb {R}^d\) each of which has an existence probability, a SCH refers to the convex hull of a realization of the dataset, i.e., a random sample including each point with its existence probability. We are interested in computing certain expected statistics of a SCH, including diameter, width, and combinatorial complexity. For diameter, we establish the first deterministic 1.633-approximation algorithm with a time complexity polynomial in both n and d. For width, two approximation algorithms are provided: a deterministic O(1)-approximation running in \(O(n^{d+1} \log n)\) time, and a fully polynomial-time randomized approximation scheme (FPRAS). For combinatorial complexity, we propose an exact \(O(n^d)\)-time algorithm. Our solutions exploit many geometric insights in Euclidean space, some of which might be of independent interest.

[1]  Subhash Suri,et al.  On the Most Likely Voronoi Diagramand Nearest Neighbor Searching , 2014, ISAAC.

[2]  Yuan Li,et al.  Stochastic Closest-Pair Problem and Most-Likely Nearest-Neighbor Search in Tree Spaces , 2017, WADS.

[3]  Yuan Li,et al.  On the Separability of Stochastic Geometric Objects, with Applications , 2016, SoCG.

[4]  Jian Li,et al.  Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points , 2015, ICALP.

[5]  Subhash Suri,et al.  On the Most Likely Convex Hull of Uncertain Points , 2013, ESA.

[6]  Ömer Egecioglu,et al.  Approximating the Diameter of a Set of Points in the Euclidean Space , 1989, Inf. Process. Lett..

[7]  Timothy M. Chan,et al.  Stochastic minimum spanning trees in euclidean spaces , 2011, SoCG '11.

[8]  Leonidas J. Guibas,et al.  Topologically sweeping an arrangement , 1986, STOC '86.

[9]  Maarten Löffler,et al.  Largest and Smallest Convex Hulls for Imprecise Points , 2010, Algorithmica.

[10]  Yuan Li,et al.  The Most-Likely Skyline Problem for Stochastic Points , 2017, CCCG.

[11]  Chao Li,et al.  Expected computations on color spanning sets , 2015, J. Comb. Optim..

[12]  Pankaj K. Agarwal,et al.  Range searching on uncertain data , 2012, TALG.

[13]  Yuan Li,et al.  Colored stochastic dominance problems , 2016, ArXiv.

[14]  Maarten Löffler,et al.  Data Imprecision in Computational Geometry , 2009 .

[15]  Jian Li,et al.  epsilon-Kernel Coresets for Stochastic Points , 2016, ESA.

[16]  Maarten Löffler,et al.  Geometric Computations on Indecisive Points , 2011, WADS.

[17]  Yuan Li,et al.  On the Expected Diameter, Width, and Complexity of a Stochastic Convex-Hull , 2017, WADS.

[18]  Timothy M. Chan,et al.  Closest pair and the post office problem for stochastic points , 2011, Comput. Geom..

[19]  Subhash Suri,et al.  Hyperplane separability and convexity of probabilistic point sets , 2017, J. Comput. Geom..

[20]  Sariel Har-Peled,et al.  Efficiently approximating the minimum-volume bounding box of a point set in three dimensions , 1999, SODA '99.

[21]  Subhash Suri,et al.  Range-Max Queries on Uncertain Data , 2016, PODS.

[22]  Pankaj K. Agarwal,et al.  Convex Hulls Under Uncertainty , 2016, Algorithmica.