pith. sign in

arxiv: 1709.09380 · v1 · pith:T4X2AFHWnew · submitted 2017-09-27 · 🧮 math.PR · math.CO· math.MG

Poisson-Delaunay Mosaics of Order k

classification 🧮 math.PR math.COmath.MG
keywords facesgivenmathbbnearestpointsareaassumingconvex
0
0 comments X
read the original abstract

The order-$k$ Voronoi tessellation of a locally finite set $X \subseteq \mathbb{R}^n$ decomposes $\mathbb{R}^n$ into convex domains whose points have the same $k$ nearest neighbors in $X$. Assuming $X$ is a stationary Poisson point process, we give explicit formulas for the expected number and total area of faces of a given dimension per unit volume of space. We also develop a relaxed version of discrete Morse theory and generalize by counting only faces, for which the $k$ nearest points in $X$ are within a given distance threshold.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.