---
res:
  bibo_abstract:
  - Slicing a Voronoi tessellation in ${R}^n$ with a $k$-plane gives a $k$-dimensional
    weighted Voronoi tessellation, also known as a 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 ${R}^n$, 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 by-product, we obtain a new proof for the expected number of connected components
    (clumps) in a line section of a circular Boolean model in ${R}^n$.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Herbert
      foaf_name: Edelsbrunner, Herbert
      foaf_surname: Edelsbrunner
      foaf_workInfoHomepage: http://www.librecat.org/personId=3FB178DA-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-9823-6833
  - foaf_Person:
      foaf_givenName: Anton
      foaf_name: Nikitenko, Anton
      foaf_surname: Nikitenko
      foaf_workInfoHomepage: http://www.librecat.org/personId=3E4FF1BA-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-0659-3201
  bibo_doi: 10.1137/S0040585X97T989726
  bibo_issue: '4'
  bibo_volume: 64
  dct_date: 2020^xs_gYear
  dct_identifier:
  - UT:000551393100007
  dct_isPartOf:
  - http://id.crossref.org/issn/0040-585X
  - http://id.crossref.org/issn/1095-7219
  dct_language: eng
  dct_publisher: SIAM@
  dct_title: Weighted Poisson–Delaunay mosaics@
...