Preprint
Article

This version is not peer-reviewed.

A Closed-Form Probability Formula for Random Points Avoiding Vertex Neighborhoods in Regular Polygons

Submitted:

15 May 2025

Posted:

16 May 2025

You are already at the latest version

Abstract
I investigated the probability $P$ that a uniformly random point within a regular n-gon ($n>6$) maintains a distance greater than the polygon's side length $l$ from every vertex. By partitioning the polygon into exclusion zones around each vertex and rigorously applying inclusion-exclusion principles, I established a closed-form expression about \( P=\frac{3n\tan{\frac{(n-2)\pi}{2n}}-2n\pi+12\pi-3\sqrt{3}n}{3n\tan{\frac{(n-2)\pi}{2n}}} \)The proof combines exclusion-zone geometry with careful handling of overlapping regions, and the result aligns with both analytic limits and numerical experiments.
Keywords: 
;  ;  

1. Introduction

Regular polygons are fundamental geometric shapes with applications spanning from material science (e.g., graphene lattices) to wireless sensor networks. A key problem in geometric probability is to determine the likelihood that a random point within a polygon satisfies specific distance constraints.
Previous studies have characterized special cases: when n = 6 , no point in a regular polygon can satisfy that the distance between this point and all the vertices of the polygon is greater than the side length of the regular polygon. This leads to a trivial probability: when n = 6 , P = 0 . For the other cases, numerical integration or probabilistic bounds are typically employed.
In this paper, I partition the polygon into exclusion zones around each vertex and meticulously account for overlapping regions through inclusion-exclusion principles, I establish the theorem.

2. Proof

2.1. Find Out the Area Formed by All Points That Meet the Requirements

Find out the area that meets the requirements. Taking a regular heptagon as an example( n = 7 ), it is not difficult for us to draw such a picture like Figure 1.
The yellow part in the middle in Figure 2 is the area that meets the requirements.
In order to find out the area of this area of any regular polygon with a side number greater than 6, we can divide the polygon into multiple parts and classify these parts like Figure 3, then we got the area a , b , c and d. It is not difficult to find that every b in the same polygon is equal, every c in the same polygon is equal, and every d in the same polygon is also equal, because the whole figure is symmetrical about the center point of a. And the area of the polygon in Figure 3 is composed of S a and 7 ( S b + S c + S d ) .
Assume the area of the whole regular polygon is S, When the number of sides of a regular polygon continues to increase, this law will not change, that is:
S a = S n ( S b + S c + S d )
So we can follow this rule to find a more specific expression of the area of a, then we can calculate the probability through this expression. but first we need to find a way to find S b + S c + S d .

2.2. Find Out the Measure

Let’s first calculate the angle composed of two adjacent sides of a regular polygon with a number of sides n( n > 6 ), assume the angle is θ ,that is
θ = ( n 2 ) π n
We can use the ratio of this angle to 2 π to find the area of the sector k enclosed by this angle with the side length of the polygon as the radius. Assume that the radius is l.
S k = ( n 2 ) l 2 π 2 n
Referring to Figure 3, it is not difficult to find that
S k = 2 S d + 3 S c + S b
Then we find out the area of the red part in Figure 4. To express it more clearly, it is better to take the regular hepetagon as an example again. Obviously, the red area consists of an area d and two areas c.
In Figure 4, H A = A B = B H , It is not difficult to find that when the number of sides increases, these three line segments are still equal, and H A B = π / 3 . Through a method similar to our method of calculating the sector area just now, we can get the area of the sector H A B , assume the sector is q.
S q = l 2 π 6
The area of the equilateral triangle we just mentioned is
S H A B = 3 4 l 2
Assume the red area is h, so the area of h is
S h = 2 ( S q S H A B ) + S H A B = 2 S q S H A B = ( 4 π 3 3 ) l 2 12
Since region h is composed of a region d and two regions c, region k is composed of two regions d, three regions c and one region b, and the areas of the two regions are subtracted to obtain the area of a region b, a region c and a region d.
S b + c + d = S k S h = 6 l 2 n π 12 l 2 π 4 π l 2 n + 3 3 n l 2 12 n
And we have the measure of the polygon
S = l 2 n tan ( n 2 ) π 2 n 4
So we got the area of a
S a = S n S b + c + d = l 2 n tan ( n 2 ) π 2 n 4 6 l 2 n π 12 l 2 π 4 π l 2 n + 3 3 n l 2 12
And the probability is
P = S a S = 3 l 2 n tan ( n 2 ) π 2 n 6 n l 2 π + 12 l 2 π + 4 π l 2 n 3 3 n l 2 3 l 2 n tan ( n 2 ) π 2 n
So the probability of meeting the conditions will be
P = S a S = 3 n tan ( n 2 ) π 2 n 2 n π + 12 π 3 3 n 3 n tan ( n 2 ) π 2 n
Finishes the proof.

References

  1. Santaló, L. A. (1976). Integral Geometry and Geometric Probability. Addison-Wesley.
  2. Weisstein, E. W. (2003). Regular Polygon. In CRC Concise Encyclopedia of Mathematics (2nd ed.). Chapman & Hall.
  3. Flajolet, P., & Sedgewick, R. (2009). Analytic Combinatorics. Cambridge University Press.
  4. Bárány, I., & Larman, D. G. (1998). Convex bodies, economic cap coverings, random polytopes. Mathematika, 45(1), 1-18.
Figure 1. The regular heptagon and the area.
Figure 1. The regular heptagon and the area.
Preprints 159659 g001
Figure 2. The regular heptagon and the area.
Figure 2. The regular heptagon and the area.
Preprints 159659 g002
Figure 3. Divided polygon.
Figure 3. Divided polygon.
Preprints 159659 g003
Figure 4. The red area.
Figure 4. The red area.
Preprints 159659 g004
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated