Interleaving Delaunay refinement and optimization for 2D triangle mesh generation

MaRDI QIDQ5442555zbMATH OpenFDO

Authors Jane Tournois, Pierre Alliez, Olivier Devillers

Publication date 22 February 2008

zbMATH Keywords

2D triangle mesh generationalgorithmbounded Voronoi diagramDelaunay refinementgraphical examplesLloyd iterationmesh smoothingoptimizationSteiner points

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• Generalized two-dimensional Delaunay mesh refinement
• A 2D advancing-front Delaunay mesh refinement algorithm
• Fully Generalized Two-Dimensional Constrained Delaunay Mesh Refinement
• scientific article; zbMATH DE number 437532

Cited in

(10)

• An improved procedure for 2D unstructured Delaunay mesh generation
• Delaunay refinement algorithms for triangular mesh generation
• High-quality 2D mesh generation without obtuse and small angles
• Interior improvement of piecewise linear interpolants defined over Delaunay triangulations
• Angle-bounded 2D mesh simplification
• A model-integrated localized collocation meshless method for large scale three-dimensional heat transfer problems
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• Fast centroidal Voronoi Delaunay triangulation for unstructured mesh generation
• Geometric properties of the adaptive Delaunay tessellation
• Computing non-obtuse triangulations with few Steiner points (CG challenge)

Describes a project that uses

Uses Software

• CGAL
• Triangle

This page was built for publication: Interleaving Delaunay refinement and optimization for 2D triangle mesh generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5442555)