A fast algorithm to sample the number of vertexes and the area of the random convex hull on the unit square
From MaRDI portal
(Redirected from Publication:2259782)
Recommendations
- Random convex hulls and extreme value statistics
- Convex hulls of samples from spherically symmetric distributions
- A linear algorithm for computing convex hulls for random lines
- On the boundary structure of the convex hull of random points
- On the convex hull of \(m\) points uniformaly distributed in a triangle
Cites work
- scientific article; zbMATH DE number 720689 (Why is no real title available?)
- A Convex Hull-Based Estimator of Home-Range Size
- An efficient algorithm for determining the convex hull of a finite planar set
- An identity relating moments of functionals of convex hulls
- Convex Hull Test for Ordered Categorical Data
- Influential Observations in Linear Regression
- Limit theorems for convex hulls
- Limit theorems for functionals of convex hulls
- Limit theorems for the convex hull of random points in higher dimensions
- On the asymptotic distribution of the area outside a random convex hull in a disk
- On the computer generation of random convex hulls
- On the oscillation of the expected number of extreme points of a random set
- Robust bivariate boxplots and multiple outlier detection.
- The 1972 Wald Lecture Robust Statistics: A Review
- The Exact Distribution of the Number of Vertices of a Random Convex Chain
- The Ultimate Planar Convex Hull Algorithm?
- The convex hull of a normal sample
- The convex hull of a random set of points
- �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten
- �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten. II
This page was built for publication: A fast algorithm to sample the number of vertexes and the area of the random convex hull on the unit square
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2259782)