On Order Types of Random Point Sets - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2020

On Order Types of Random Point Sets


A simple method to produce a random order type is to take the order type of a random point set. We conjecture that many probability distributions on order types defined in this way are heavily concentrated and therefore sample inefficiently the space of order types. We present two results on this question. First, we study experimentally the bias in the order types of $n$ random points chosen uniformly and independently in a square, for $n$ up to $16$. Second, we study algorithms for determining the order type of a point set in terms of the number of coordinate bits they require to know. We give an algorithm that requires on average $4n \log_2 n+O(n)$ bits to determine the order type of $P$, and show that any algorithm requires at least $4n \log_2 n - O(n \log\log n)$ bits. This implies that the concentration conjecture cannot be proven by an "efficient encoding'' argument.
Fichier principal
Vignette du fichier
v2.pdf (1.31 Mo) Télécharger le fichier
Vignette du fichier
vignette.png (156.56 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Format Figure, Image

Dates and versions

hal-01962093 , version 1 (20-12-2018)
hal-01962093 , version 2 (28-05-2020)



Olivier Devillers, Philippe Duchon, Marc Glisse, Xavier Goaoc. On Order Types of Random Point Sets. 2020. ⟨hal-01962093v2⟩
400 View
241 Download



Gmail Mastodon Facebook X LinkedIn More