Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties
From MaRDI portal
Publication:5072221
DOI10.1142/S0218195921500059OpenAlexW4210789506MaRDI QIDQ5072221FDOQ5072221
Authors: Rivka Gitik, Leo Joskowicz
Publication date: 26 April 2022
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195921500059
Delaunay triangulationVoronoi diagramdependent and independent geometric uncertaintyuncertain point locationVoronoi diagram stability
Cites Work
- Global optimization with polynomials and the problem of moments
- Robust optimization
- Semidefinite programming relaxations for semialgebraic problems
- On the stability of Voronoi cells
- The Geometric Stability of Voronoi Diagrams with Respect to Small Changes of the Sites
- Constructing strongly convex approximate hulls with inaccurate primitives
- Title not available (Why is that?)
- Delaunay triangulations of imprecise pointsin linear time after preprocessing
- Computability of partial Delaunay triangulation and Voronoi diagram (extended abstract)
- Largest and smallest convex hulls for imprecise points
- Stochastic minimum spanning trees in Euclidean spaces
- The stability of Delaunay triangulations
- New Computational Paradigms
- Uncertain Voronoi diagram
- Title not available (Why is that?)
- Voronoi Diagrams of Moving Points
- Closest pair and the post office problem for stochastic points
- On the Most Likely Convex Hull of Uncertain Points
- On the Most Likely Voronoi Diagram and Nearest Neighbor Searching
- Point set distance and orthogonal range problems with dependent geometric uncertainties
- Vertex removal in two-dimensional Delaunay triangulation: speed-up by low degrees optimization
- Structural tolerance and Delaunay triangulation
- Voronoi diagram of a circle set from Voronoi diagram of a point set: II. Geometry
- Kinetic stable Delaunay graphs
- Correct Delaunay triangulation in the presence of inexact inputs and arithmetic
- Title not available (Why is that?)
- Almost-Delaunay simplices, nearest neighbor relations for imprecise points
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- The Voronoi diagram of planar convex objects
- A framework for algorithm stability and its application to kinetic Euclidean MSTs
- Constructing strongly convex hulls using exact or rounded arithmetic
- Stable Delaunay graphs
- Space-efficient approximate Voronoi diagrams
- Computing convex hull in a floating point arithmetic
- Voronoi diagram of a circle set from Voronoi diagram of a point set: I. Topology
- Euclidean minimum spanning trees with independent and dependent geometric uncertainties
Cited In (3)
This page was built for publication: Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5072221)