Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations

DOI10.1016/J.COMGEO.2008.06.002zbMath1155.65020OpenAlexW1973509809MaRDI QIDQ955223

Alper Üngör

Publication date: 19 November 2008

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.06.002

zbMATH Keywords

algorithmSteiner pointscomputational geometryDelaunay triangulationsgraphical examplesDelaunay refinementiterative insertion of off-centers

Mathematics Subject Classification ID

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

Related Items (2)

Thread-parallel mesh improvement using face and edge swapping and vertex insertion ⋮ A 2D advancing-front Delaunay mesh refinement algorithm

Uses Software

• Triangle

Cites Work

• Unnamed Item
• Unnamed Item
• Constrained Delaunay triangulations
• Provably good mesh generation
• Delaunay refinement algorithms for triangular mesh generation
• Geometry and Topology for Mesh Generation
• ON GOOD TRIANGULATIONS IN THREE DIMENSIONS
• Euro-Par 2004 Parallel Processing
• Sink-insertion for mesh improvement
• A time-optimal delaunay refinement algorithm in two dimensions

This page was built for publication: Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations