Computing correct Delaunay triangulations

DOI10.1007/BF02242021zbMath0738.65107OpenAlexW124442954MaRDI QIDQ1179540

D. Zepf, Michael Jünger, Gerhard Reinelt

Publication date: 26 June 1992

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02242021

zbMATH Keywords

computational geometryDelaunay triangulationgeometric optimization algorithmsnumerically stable computer implementationVoronoj diagram

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Triangulation and topological properties of semi-analytic andsubanalytic sets, and related questions (32B25)

Related Items

New primal and dual matching heuristics, A general approach to the analysis of controlled perturbation algorithms, The finite volume method and application in combinations

Cites Work

• IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS