OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS

DOI10.1142/S0218195910003219zbMath1196.65040OpenAlexW2133457257MaRDI QIDQ5305065

Stefan Funke, Tetsuo Asano, Boris Aronov

Publication date: 19 March 2010

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195910003219

zbMATH Keywords

triangulationconvex hullpolynomial-time algorithmVoronoi diagramDelaunay triangulationconstrained Delaunay triangulationSteiner pointmesh improvementminimum internal angle

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Generalized Delaunay triangulation for planar graphs
• Triangulating a simple polygon in linear time
• Delaunay refinement algorithms for triangular mesh generation
• A subexponential bound for linear programming
• Edge insertion for optimal triangulations
• Almost tight upper bounds for vertical decompositions in four dimensions
• Minimum-weight triangulation is NP-hard
• Laplacian smoothing and Delaunay triangulations