Cargando…
Poisson–Delaunay Mosaics of Order k
The order-k Voronoi tessellation of a locally finite set [Formula: see text] decomposes [Formula: see text] 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 f...
Autores principales: | Edelsbrunner, Herbert, Nikitenko, Anton |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6828637/ https://www.ncbi.nlm.nih.gov/pubmed/31749513 http://dx.doi.org/10.1007/s00454-018-0049-2 |
Ejemplares similares
-
A step in the Delaunay mosaic of order k
por: Edelsbrunner, Herbert, et al.
Publicado: (2021) -
A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes
por: Edelsbrunner, Herbert, et al.
Publicado: (2022) -
Blocking Delaunay triangulations
por: Aichholzer, Oswin, et al.
Publicado: (2013) -
Delaunay mesh generation
por: Cheng, Siu-Wing, et al.
Publicado: (2013) -
New approaches for Delaunay triangulation and optimisation
por: Perumal, Logah
Publicado: (2019)