Poisson-Delaunay Mosaics of Order $k$
Probability
2019-04-26 v1 Combinatorics
Metric Geometry
Abstract
The order- Voronoi tessellation of a locally finite set decomposes into convex domains whose points have the same nearest neighbors in . Assuming 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 nearest points in are within a given distance threshold.
Keywords
Cite
@article{arxiv.1709.09380,
title = {Poisson-Delaunay Mosaics of Order $k$},
author = {Herbert Edelsbrunner and Anton Nikitenko},
journal= {arXiv preprint arXiv:1709.09380},
year = {2019}
}
Comments
11 pages. Discrete & Computational Geometry (2018)