Weighted Poisson--Delaunay Mosaics

From MaRDI portal
Publication:5216293

DOI10.1137/S0040585X97T989726zbMATH Open1432.60023arXiv1705.08735OpenAlexW2982010117MaRDI QIDQ5216293FDOQ5216293

Anton V. Nikitenko, Herbert Edelsbrunner

Publication date: 17 February 2020

Published in: Theory of Probability & Its Applications (Search for Journal in Brave)

Abstract: Slicing a Voronoi tessellation in mathbbRn with a k-plane gives a k-dimensional weighted Voronoi tessellation, also known as power diagram or Laguerre tessellation. Mapping every simplex of the dual weighted Delaunay mosaic to the radius of the smallest empty circumscribed sphere whose center lies in the k-plane gives a generalized discrete Morse function. Assuming the Voronoi tessellation is generated by a Poisson point process in mathbbRn, we study the expected number of simplices in the k-dimensional weighted Delaunay mosaic as well as the expected number of intervals of the Morse function, both as functions of a radius threshold. As a byproduct, we obtain a new proof for the expected number of connected components (clumps) in a line section of a circular Boolean model in mathbbRn


Full work available at URL: https://arxiv.org/abs/1705.08735




Recommendations




Cites Work


Uses Software





This page was built for publication: Weighted Poisson--Delaunay Mosaics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5216293)