Mesh smoothing algorithms for complex geometric domains

DOI10.1007/978-3-642-04319-2_11MaRDI QIDQ7357462zbMATH OpenFDO

Authors Hale Erten, Alper Üngör, Chunchun Zhao

Publication date 25 September 2026

Full work available at URL https://doi.org/10.1007/978-3-642-04319-2_11

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites work

• A constrained optimization approach to finite element mesh smoothing
• Centroidal Voronoi Tessellations: Applications and Algorithms
• Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations
• Grid generation and optimization based on centroidal Voronoi tessellations
• scientific article; zbMATH DE number 2066953 (Why is no real title available?)
• scientific article; zbMATH DE number 1424294 (Why is no real title available?)
• scientific article; zbMATH DE number 5239206 (Why is no real title available?)
• scientific article; zbMATH DE number 6472629 (Why is no real title available?)
• Laplacian smoothing and Delaunay triangulations
• Least squares quantization in PCM
• Mesh Smoothing Using A Posteriori Error Estimates
• Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations
• On the Angle Condition in the Finite Element Method
• Optismoothing: An optimization-driven approach to mesh smoothing
• Provably good mesh generation
• Quality Triangulations with Locally Optimal Steiner Points
• Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellations

This page was built for publication: Mesh smoothing algorithms for complex geometric domains

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