Convex Hulls of Random Order Types

by   Xavier Goaoc, et al.

We establish the following two main results on order types of points in general position in the plane (realizable simple planar order types, realizable uniform acyclic oriented matroids of rank 3): (a) The number of extreme points in an n-point order type, chosen uniformly at random from all such order types, is on average 4+o(1). For labeled order types, this number has average 4- 8/n^2 - n +2 and variance at most 3. (b) The (labeled) order types read off a set of n points sampled independently from the uniform measure on a convex planar domain, smooth or polygonal, or from a Gaussian distribution are concentrated, i.e. such sampling typically encounters only a vanishingly small fraction of all order types of the given size. Result (a) generalizes to arbitrary dimension d for labeled order types with the average number of extreme points 2d+o(1) and constant variance. We also discuss to what extent our methods generalize to the abstract setting of uniform acyclic oriented matroids. Moreover, our methods allow to show the following relative of the Erdős-Szekeres theorem: for any fixed k, as n →∞, a proportion 1 - O(1/n) of the n-point simple order types contain a triangle enclosing a convex k-chain over an edge. For the unlabeled case in (a), we prove that for any antipodal, finite subset of the 2-dimensional sphere, the group of orientation preserving bijections is cyclic, dihedral or one of A_4, S_4 or A_5 (and each case is possible). These are the finite subgroups of SO(3) and our proof follows the lines of their characterization by Felix Klein.


page 1

page 2

page 3

page 4


Holes and islands in random point sets

For d ∈ℕ, let S be a finite set of points in ℝ^d in general position. A ...

Chirotopes of Random Points in Space are Realizable on a Small Integer Grid

We prove that with high probability, a uniform sample of n points in a c...

Geodesic Order Types

The geodesic between two points a and b in the interior of a simple poly...

Tight bounds on the expected number of holes in random point sets

For integers d ≥ 2 and k ≥ d+1, a k-hole in a set S of points in general...

Expected Size of Random Tukey Layers and Convex Layers

We study the Tukey layers and convex layers of a planar point set, which...

On Order Types of Random Point Sets

Let P be a set of n random points chosen uniformly in the unit square. I...

Extension complexity of low-dimensional polytopes

Sometimes, it is possible to represent a complicated polytope as a proje...

Please sign up or login with your details

Forgot password? Click here to reset