On Order Types of Random Point Sets

12/20/2018
by   Olivier Devillers, et al.
0

Let P be a set of n random points chosen uniformly in the unit square. In this paper, we examine the typical resolution of the order type of P. First, we show that with high probability, P can be rounded to the grid of step 1/n^3+ϵ without changing its order type. Second, we study algorithms for determining the order type of a point set in terms of the the number of coordinate bits they require to know. We give an algorithm that requires on average 4n 2 n + O(n) bits to determine the order type of P, and show that any algorithm requires at least 4n 2 n -- O(n n) bits. Both results extend to more general models of random point sets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/22/2020

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...
research
01/05/2018

Subquadratic Encodings for Point Configurations

For most algorithms dealing with sets of points in the plane, the only r...
research
08/21/2017

Geodesic Order Types

The geodesic between two points a and b in the interior of a simple poly...
research
07/10/2019

Smoothed Analysis of Order Types

Consider an ordered point set P = (p_1,...,p_n), its order type (denoted...
research
08/19/2019

An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs

A set U⊆^2 is n-universal if all n-vertex planar graphs have a planar st...
research
03/18/2020

Convex Hulls of Random Order Types

We establish the following two main results on order types of points in ...
research
11/05/2017

Practical Data-Dependent Metric Compression with Provable Guarantees

We introduce a new distance-preserving compact representation of multi-d...

Please sign up or login with your details

Forgot password? Click here to reset