Asymptotic statistics of the n-sided planar Voronoi cell: II. Heuristics
Abstract
We develop a set of heuristic arguments to explain several results on planar Poisson-Voronoi tessellations that were derived earlier at the cost of considerable mathematical effort. The results concern Voronoi cells having a large number n of sides. The arguments start from an entropy balance applied to the arrangement of n neighbors around a central cell. It is followed by a simplified evaluation of the phase space integral for the probability pn that an arbitrary cell be n-sided. The limitations of the arguments are indicated. As a new application we calculate the expected number of Gabriel (or full) neighbors of an n-sided cell in the large-n limit.
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.