A back-tracking procedure for optimization of simplex meshes

DOI10.1002/cnm.786zbMath1082.65017OpenAlexW2119439180MaRDI QIDQ5717689

A. R. Ingraffea, P. A. Wawrzynek, J. B. Cavalcante Neto, L. F. Martha

Publication date: 10 January 2006

Published in: Communications in Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cnm.786

zbMATH Keywords

finite elementsnumerical examplesadaptivitymesh generationDelaunay triangulationmesh optimizationgraphical examplessimplex elementsback-tracking procedureill-shaped elementsreconstruction operationsvisibility tests

Mathematics Subject Classification ID

Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Cites Work

• Unnamed Item
• Unnamed Item
• Relationship between tetrahedron shape measures
• An algorithm for three-dimensional mesh generation for arbitrary regions with cracks
• AN AUTOMATIC TETRAHEDRAL MESH GENERATION SCHEME BY THE ADVANCING FRONT METHOD
• Laplacian smoothing and Delaunay triangulations
• Delaunay versus max-min solid angle triangulations for three-dimensional mesh generation
• Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
• ASPECTS OF 2-D DELAUNAY MESH GENERATION
• Generalized Laplacian smoothing of unstructured grids

This page was built for publication: A back-tracking procedure for optimization of simplex meshes