Weighted Poisson--Delaunay Mosaics

From MaRDI portal
Publication:5216293




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





Describes a project that uses

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)