Cargando…
A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes
We present a simple algorithm for computing higher-order Delaunay mosaics that works in Euclidean spaces of any finite dimensions. The algorithm selects the vertices of the order-k mosaic from incrementally constructed lower-order mosaics and uses an algorithm for weighted first-order Delaunay mosai...
Autores principales: | Edelsbrunner, Herbert, Osang, Georg |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9849181/ https://www.ncbi.nlm.nih.gov/pubmed/36687803 http://dx.doi.org/10.1007/s00453-022-01027-6 |
Ejemplares similares
-
A step in the Delaunay mosaic of order k
por: Edelsbrunner, Herbert, et al.
Publicado: (2021) -
Poisson–Delaunay Mosaics of Order k
por: Edelsbrunner, Herbert, et al.
Publicado: (2018) -
The Multi-Cover Persistence of Euclidean Balls
por: Edelsbrunner, Herbert, et al.
Publicado: (2021) -
Variable Density Filling Algorithm Based on Delaunay Triangulation
por: Qiao, Yujing, et al.
Publicado: (2022) -
Blocking Delaunay triangulations
por: Aichholzer, Oswin, et al.
Publicado: (2013)