Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties
From MaRDI portal
Publication:5072221
DOI10.1142/S0218195921500059OpenAlexW4210789506MaRDI QIDQ5072221
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
Voronoi diagramDelaunay triangulationdependent and independent geometric uncertaintyuncertain point locationVoronoi diagram stability
Related Items (1)
Cites Work
- Vertex removal in two-dimensional Delaunay triangulation: speed-up by low degrees optimization
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Largest and smallest convex hulls for imprecise points
- Stable Delaunay graphs
- Uncertain Voronoi diagram
- Constructing strongly convex hulls using exact or rounded arithmetic
- Computing convex hull in a floating point arithmetic
- Semidefinite programming relaxations for semialgebraic problems
- Structural tolerance and Delaunay triangulation
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- On the stability of Voronoi cells
- Correct Delaunay triangulation in the presence of inexact inputs and arithmetic
- Euclidean minimum spanning trees with independent and dependent geometric uncertainties
- A framework for algorithm stability and its application to kinetic Euclidean MSTs
- Constructing strongly convex approximate hulls with inaccurate primitives
- Convex hulls under uncertainty
- Global Optimization with Polynomials and the Problem of Moments
- On the Most Likely Convex Hull of Uncertain Points
- THE STABILITY OF DELAUNAY TRIANGULATIONS
- On the Most Likely Voronoi Diagram and Nearest Neighbor Searching
- Space-efficient approximate Voronoi diagrams
- Delaunay triangulations of imprecise pointsin linear time after preprocessing
- Voronoi Diagrams of Moving Points
- Computability of Partial Delaunay Triangulation and Voronoi Diagram [Extended Abstract]
- Closest Pair and the Post Office Problem for Stochastic Points
- POINT SET DISTANCE AND ORTHOGONAL RANGE PROBLEMS WITH DEPENDENT GEOMETRIC UNCERTAINTIES
- Stochastic minimum spanning trees in euclidean spaces
- The Geometric Stability of Voronoi Diagrams with Respect to Small Changes of the Sites
- Kinetic stable Delaunay graphs
- New Computational Paradigms
- Algorithms - ESA 2003
- Voronoi diagram of a circle set from Voronoi diagram of a point set: I. Topology
- Voronoi diagram of a circle set from Voronoi diagram of a point set: II. Geometry
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties
