NUMERICAL STABILITY OF ALGORITHMS FOR 2D DELAUNAY TRIANGULATIONS
From MaRDI portal
Publication:4698358
Recommendations
- The stability of Delaunay triangulations
- Numerical stability of a convex hull algorithm for simple polygons
- Delaunay stability via perturbations
- scientific article; zbMATH DE number 4078610
- Publication:3201738
- Stability of solutions in problems of computational geometry
- A time-optimal delaunay refinement algorithm in two dimensions
- Delaunay triangulations in three dimensions with finite precision arithmetic
- The integrity of geometrical boundaries in the two-dimensional delaunay triangulation
- Correct Delaunay triangulation in the presence of inexact inputs and arithmetic
Cited in
(17)- THE L∞ VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS
- A low arithmetic-degree algorithm for computing proximity graphs
- Capillary transport in paper porous materials at low saturation levels: normal, fast or superfast?
- Diagonal swap procedures and characterizations of 2D-Delaunay triangulations
- Delaunay triangulation of imprecise points in linear time after preprocessing
- A resistor interpretation of general anisotropic cardiac tissue.
- Automatic mesh generation on a regular background grid.
- Controlled perturbation for Delaunay triangulations
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING
- Formal study of plane Delaunay triangulation
- The stability of Delaunay triangulations
- Ideal hyperbolic polyhedra and discrete uniformization
- Floating-point arithmetic for computational geometry problems with uncertain data
- Correct Delaunay triangulation in the presence of inexact inputs and arithmetic
- Implementing geometric algorithms robustly
- Robustness issues in geometric algorithms
- Classroom examples of robustness problems in geometric computations
This page was built for publication: NUMERICAL STABILITY OF ALGORITHMS FOR 2D DELAUNAY TRIANGULATIONS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4698358)
