scientific article; zbMATH DE number 7525459
From MaRDI portal
Publication:5075759
DOI10.4230/LIPIcs.ESA.2019.22MaRDI QIDQ5075759
Kunal Dutta, Marc Glisse, Jean-Daniel Boissonnat, Olivier Devillers
Publication date: 11 May 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
probabilistic analysisVoronoi diagramsDelaunay triangulationsrandomized incremental constructionpolyhedral surfaces
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces
- Higher-dimensional Voronoi diagrams in linear expected time
- On the randomized construction of the Delaunay tree
- The expected number of \(k\)-faces of a Voronoi diagram
- Smooth surface reconstruction via natural neighbour interpolation of distance functions
- Dense point sets have sparse Delaunay triangulations or ``\dots but not too nasty
- Surface reconstruction by Voronoi filtering
- Applications of random sampling in computational geometry. II
- On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes
- THE DELAUNAY HIERARCHY
- RANDOMIZATION YIELDS SIMPLE O(n log⋆ n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS
- Random tessellations in ℝd
- Nice point sets can have nasty Delaunay triangulations
- Complexity of the delaunay triangulation of points on surfaces the smooth case
- Incremental constructions con BRIO
- Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
This page was built for publication:
