Hostname: page-component-89b8bd64d-46n74 Total loading time: 0 Render date: 2026-05-07T10:15:07.197Z Has data issue: false hasContentIssue false

Probability that n points are in convex position in a regular κ-gon: Asymptotic results

Published online by Cambridge University Press:  17 January 2025

Ludovic Morin*
Affiliation:
Université de Bordeaux, LaBRI
*
*Postal address: Université de Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR 5800, F-33400 Talence, France. Email address: ludovic.morin@labri.fr
Rights & Permissions [Opens in a new window]

Abstract

Let $\mathbb{P}_\kappa(n)$ be the probability that n points $z_1,\ldots,z_n$ picked uniformly and independently in $\mathfrak{C}_\kappa$, a regular $\kappa$-gon with area 1, are in convex position, that is, form the vertex set of a convex polygon. In this paper, we compute $\mathbb{P}_\kappa(n)$ up to asymptotic equivalence, as $n\to+\infty$, for all $\kappa\geq 3$, which improves on a famous result of Bárány (Ann. Prob. 27, 1999). The second purpose of this paper is to establish a limit theorem which describes the fluctuations around the limit shape of an n-tuple of points in convex position when $n\to+\infty$. Finally, we give an asymptotically exact algorithm for the random generation of $z_1,\ldots,z_n$, conditioned to be in convex position in $\mathfrak{C}_\kappa$.

Information

Type
Original Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2025. Published by Cambridge University Press on behalf of Applied Probability Trust
Figure 0

Figure 1. $\mathfrak{C}_7$.

Figure 1

Figure 2. Some z[n] in $\mathcal{C}_7(n)$.

Figure 2

Figure 3. For each case $\kappa=3, 4, 6$, the inner dashed curve delimits a convex domain $\mathsf{Dom}(\mathfrak{C}_\kappa)$ inside $\mathfrak{C}_\kappa$. The dashed curve represents the limit shape of a $\mathbf{z}[n]$-gon taken under $\mathbb{U}^{(n)}_{\kappa}$, conditioned to be in convex position, as $n\to+\infty$. The curve can be drawn as follows: add the midpoints of the sides of the initial $\kappa$-gon, and between two consecutive midpoints, add the arc of the parabola which is tangent to the sides and incident to these inner points. The sum of the hatched areas corresponds to the supremum of affine perimeters (for an explanation see Lemma 17 in the appendix).

Figure 3

Figure 4. On the left, we draw an $\mathsf{ECP}({z}[n])$ for an n-tuple taken in $\overset{\curvearrowleft}{\mathcal{C}_7}(n)$, with distances $\ell[7]$ from the sides of $\mathfrak{C}_7$ to those of $\mathsf{ECP}(z[n])$. This latter polygon, whose side lengths are given by the tuple of values c[7], is drawn with a dashed boundary inside $\mathfrak{C}_7$. On the right, a six-sided $\mathsf{ECP}({z}[n])$ in $\mathfrak{C}_7$. One of the sides is reduced to a point: this happens when three consecutive values $\ell_{{j-1}},\ell_j,\ell_{{j+1}}$ are defined on the same point $z_i$ in z[n].

Figure 4

Figure 5. Characteristics of an internal polygon.

Figure 5

Figure 6. In $\mathfrak{C}_7$, an example of a z[n]-gon, the $\mathsf{ECP}({z}[n])$, and its vertices $\mathsf{b}[7]$, as well as the first and second corners (the hashed areas). Here we have $s[7]=(2,3,1,2,1,3,0)$.

Figure 6

Figure 7. An example in the square case, where the $\mathsf{ECP}$ is always a rectangle.

Figure 7

Figure 8. The map $\varphi_{j}$.

Figure 8

Figure 9. A convex chain in a right triangle abc.

Figure 9

Figure 10. The jth side-partition $(0=u_0^{(j)} \lt u_1^{(j)} \lt \ldots \lt u_{N_j}^{(j)} \lt u_{N_j+1}^{(j)}=c_j)$ of $c_j$, with $s_j=2$, $s_{{j+1}}=3$. An alternative way of building the $u^{(j)}[N_j,c_j]$ will be given in Figure 11. Notice here that we see the contact point on $c_j$, but we do not mark it; we treat it the same as the other points.

Figure 10

Figure 11. The map $\varphi_j$ (resp. $\varphi_{{j-1}}$), as introduced in Figure 8, sends the triangle $\mathsf{corner}_j$ (resp. $\mathsf{corner}_{{j-1}}$) to the triangle $A^{\prime}_jB^{\prime}_jC^{\prime}_j$ (resp. $A^{\prime}_{{j-1}}B^{\prime}_{{j-1}}C^{\prime}_{{j-1}}$). If we perform one more rotation, which is equivalent to setting $C^{\prime}_{{j-1}}=A^{\prime}_j$ and fixing $B^{\prime}_{{j-1}},A^{\prime}_j,B^{\prime}_j$ on the same line, we may interpret the side-partitions just as they appear in the right-hand panel.

Figure 11

Figure 12. Vector-building.

Figure 12

Figure 13. In the first drawing, given a partition in $I[c_j,s_{{j-1}}+s_j]$ and a partition in $I[c_{{j+1}},s_j+s_{{j+1}}]$, we randomly pair $s_j$ pieces of $c_j$ with $s_j$ pieces of $c_{{j+1}}$ to form the vectors in the jth corner. Note that an affine transformation is hiding in the construction of these vectors. In the second drawing, vectors have been reordered by increasing slope. The points $\mathsf{cp}_j,\mathsf{cp}_{{j+1}}$ naturally appear as the edges of the convex chain formed by those vectors. In these particular drawings, we took $s_j=3$, $s_{{j-1}}=2$, $s_{{j+1}}=2$.

Figure 13

Algorithm 1 $\kappa$-sampling

Figure 14

Figure 14. Two examples of $\kappa$-sampling. The set of points is the set of vertices of a convex z[n]-gon, whose boundary is very close to the limit shape drawn inside the $\kappa$-gon.

Figure 15

Algorithm 2 $\triangle$-sampling

Figure 16

Figure 15. A $\triangle$-sampling, some z[n]-gon for $n=1000$, close to the limit shape.

Figure 17

Algorithm 3. $\Box$-sampling

Figure 18

Figure 16. A $\Box$-sampling, some z[n]-gon for $n=1000$, close to the limit shape.

Figure 19

Figure 17. For each of the cases $\kappa=3, 4, 6$, the inner dashed curve is the boundary of the domain $\mathsf{Dom}(\mathfrak{C}_\kappa)$. By the limit shape theorem, it also represents the boundary of a $\mathbf{z}[n]$-gon where $\mathbf{z}[n]$ is taken under $\mathbb{Q}^{(n)}_{\kappa}$, when $n\to+\infty$.

Figure 20

Figure 18. Blaschke’s property for arcs of parabolas.