Revisiting Optimal Delaunay Triangulation for 3D Graded Mesh Generation

DOI10.1137/120875132zbMath1298.49049OpenAlexW2015199487MaRDI QIDQ2878937

Bruno Lévy, Feng Sun, Wenping Wang, Zhonggui Chen, Li-Gang Liu

Publication date: 5 September 2014

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/120875132

zbMATH Keywords

global optimizationmesh generationquasi-Newton methodcentroidal Voronoi tessellationoptimal Delaunay triangulation

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Newton-type methods (49M15) Methods of quasi-Newton type (90C53) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Related Items (7)

Sliver-suppressing tetrahedral mesh optimization with gradient-based shape matching energy ⋮ Tetrahedral meshing via maximal Poisson-disk sampling ⋮ Virtual and smoothed finite elements: A connection and its application to polygonal/polyhedral finite element methods ⋮ Delaunay and regular triangulations as lexicographic optimal chains ⋮ Generalised primal-dual grids for unstructured co-volume schemes ⋮ Enhanced optimal Delaunay triangulation methods with connectivity regularization ⋮ Anisotropic and feature sensitive triangular remeshing using normal lifting

Uses Software

• TetGen
• GHS3D
• adsimp

This page was built for publication: Revisiting Optimal Delaunay Triangulation for 3D Graded Mesh Generation