New interface

# On Order Types of Random Point Sets

1 GAMBLE - Geometric Algorithms and Models Beyond the Linear and Euclidean realm
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
3 DATASHAPE - Understanding the Shape of Data
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
Abstract : 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.
Document type :
Preprints, Working Papers, ...

https://hal.inria.fr/hal-01962093
Contributor : Xavier Goaoc Connect in order to contact the contributor
Submitted on : Thursday, May 28, 2020 - 5:04:46 PM
Last modification on : Saturday, July 23, 2022 - 3:52:45 AM

### Files

v2.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : hal-01962093, version 2
• ARXIV : 1812.08525

### Citation

Olivier Devillers, Philippe Duchon, Marc Glisse, Xavier Goaoc. On Order Types of Random Point Sets. {date}. ⟨hal-01962093v2⟩

Record views