Removing degeneracies by perturbing the problem or perturbing the world

DOI10.1023/A:1009942427413zbMath0996.65019OpenAlexW1919769743MaRDI QIDQ1971097

Olivier Devillers, Pierre Alliez, Jack Scott Snoeyink

Publication date: 22 March 2000

Published in: Reliable Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009942427413

zbMATH Keywords

algorithmsperturbationscomputational geometryDelaunay triangulationdegenerate casespolygonal metricsrandomized or dynamic geometric algorithms

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

ON DELETION IN DELAUNAY TRIANGULATIONS ⋮ Perturbations for Delaunay and weighted Delaunay 3D triangulations ⋮ Matching colored points with rectangles ⋮ Preferred directions for resolving the non-uniqueness of Delaunay triangulations ⋮ Maximum box problem on stochastic points