Sur L'enveloppe convexe des nuages de points aleatoires dans Rn. I

DOI10.2307/3212146zbMath0192.53602MaRDI QIDQ5587568

No author found.

Publication date: 1970

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3212146

zbMATH Keywords

probability theory

Related Items

Limit theorems for the convex hull of random points in higher dimensions, PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS, On the variance of the number of pivot steps required by the simplex algorithm, Gaussian polytopes: variances and limit theorems, Voronoi diagrams of random lines and flats, On the modality of convex polygons, On the oscillation of the expected number of extreme points of a random set, Higher-dimensional Voronoi diagrams in linear expected time, Defining extremes and trimming by minimum covering sets, Some performance tests of convex hull algorithms, The shortest path problem with two objective functions, Limit theorems for convex hulls, A note on finding convex hulls via maximal vectors, Moment inequalities for random variables in computational geometry, Convex hulls of samples from spherically symmetric distributions, The expected value of some functions of the convex hull of a random set of points sampled in \(\mathbb{R}{}^ d\), Random projections of regular simplices, Geometric medians, Divide and conquer for linear expected time, Regular simplices and Gaussian samples, A sweepline algorithm to solve the two-center problem, Geometrical tools in classification, Gaussian samples, regular simplices, and exchangeability, Output-sensitive results on convex hulls, extreme points, and related problems, Random convex hulls in a product of balls, Central limit theorems for Gaussian polytopes, Parallelization alternatives and their performance for the convex hull problem, The Average number of pivot steps required by the Simplex-Method is polynomial