NUMERICAL STABILITY OF ALGORITHMS FOR 2D DELAUNAY TRIANGULATIONS
From MaRDI portal
Publication:4698358
DOI10.1142/S0218195995000118zbMath0818.68080MaRDI QIDQ4698358
Publication date: 20 August 1995
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Related Items
A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs ⋮ Ideal hyperbolic polyhedra and discrete uniformization ⋮ A resistor interpretation of general anisotropic cardiac tissue. ⋮ Automatic mesh generation on a regular background grid. ⋮ Capillary transport in paper porous materials at low saturation levels: normal, fast or superfast? ⋮ Classroom examples of robustness problems in geometric computations ⋮ THE L∞ VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS ⋮ A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING ⋮ FLOATING-POINT ARITHMETIC FOR COMPUTATIONAL GEOMETRY PROBLEMS WITH UNCERTAIN DATA ⋮ Delaunay triangulation of imprecise points in linear time after preprocessing
