• The Inria's Research Teams produce an annual Activity Report presenting their activities and their results of the year. These reports include the team members, the scientific program, the software developed by the team and the new results of the year. The report also describes the grants, contracts and the activities of dissemination and teaching. Finally, the report gives the list of publications of the year.

• Legal notice
• Cookie management
• Personal data
• Cookies

Section: New Results

Miscellaneous

On Order Types of Random Point Sets

Participant : Marc Glisse.

In collaboration with Olivier Devillers and Xavier Goaoc (Inria team Gamble) and Philippe Duchon (LaBRI, Université de Bordeaux).

Let $P$ be a set of $n$ random points chosen uniformly in the unit square. In this paper [41], 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 $\frac{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 number of coordinate bits they require to know. We give an algorithm that requires on average $4n{log}_{2}n+O\left(n\right)$ bits to determine the order type of $P$, and show that any algorithm requires at least $4n{log}_{2}n-O\left(nloglogn\right)$ bits. Both results extend to more general models of random point sets.