Smoothing and cleaning up slivers
From MaRDI portal
Publication:3191993
DOI10.1145/335305.335338zbMath1296.68175OpenAlexW2052793762MaRDI QIDQ3191993
Noel J. Walkington, Alper Üngör, Andreas Stathopoulos, D. Talmor, Xiang-Yang Li, Gary Lee Miller, Herbert Edelsbrunner, Shang-Hua Teng
Publication date: 26 September 2014
Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/335305.335338
mesh generationcomputational geometrytetrahedral meshesDelaunay triangulationsmesh smoothingsliversmesh clean-up
Related Items
An interface-fitted mesh generator and virtual element methods for elliptic interface problems ⋮ Generating well-shaped \(d\)-dimensional Delaunay meshes. ⋮ Efficient mesh optimization schemes based on optimal Delaunay triangulations ⋮ Adaptive tetrahedral mesh generation by constrained centroidal voronoi‐delaunay tessellations for finite element methods ⋮ Adaptive tetrahedral mesh generation by constrained Delaunay refinement ⋮ Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellations ⋮ Interpolation error estimates for harmonic coordinates on polytopes ⋮ Delaunay simplices in diagonally distorted lattices ⋮ Anisotropic Delaunay Mesh Generation