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]  Subhash Suri,et al.  Hyperplane Separability and Convexity of Probabilistic Point Sets , 2016, Symposium on Computational Geometry.

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

[4]  Subhash Suri,et al.  Range-max queries on uncertain data , 2018, J. Comput. Syst. Sci..

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

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

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

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

[9]  罗军,et al.  Expected Computations on Color Spanning Sets , 2013 .

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

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

[12]  Timothy M. Chan,et al.  Closest Pair and the Post Office Problem for Stochastic Points , 2011, WADS.

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

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

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

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

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

[18]  Boris Aronov,et al.  Nearest-Neighbor Searching Under Uncertainty II , 2016 .