Distance Distributions in Regular Polygons

Abstract

This paper derives the exact cumulative density function of the distance between a randomly located node and any arbitrary reference point inside a regular -sided polygon. Using this result, we obtain the closed-form probability density function (PDF) of the Euclidean distance between any arbitrary reference point and its n-th neighbour node, when N nodes are uniformly and independently distributed inside a regular -sided polygon. First, we exploit the rotational symmetry of the regular polygons and quantify the effect of polygon sides and vertices on the distance distributions. Then we propose an algorithm to determine the distance distributions given any arbitrary location of the reference point inside the polygon. For the special case when the arbitrary reference point is located at the center of the polygon, our framework reproduces the existing result in the literature.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…