Refinement based on longest-edge and self-similar four-triangle partitions

DOI10.1016/j.matcom.2006.12.010zbMath1124.65026MaRDI QIDQ2384517

José P. Suárez, Ángel Plaza, Miguel A. Padrón

Publication date: 10 October 2007

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2006.12.010

zbMATH Keywords

numerical experiments; finite element; bisection; longest-edge based algorithms; uniform refinement; Mesh quality

Mathematics Subject Classification ID

65N30: Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs

65D18: Numerical aspects of computer graphics, image analysis, and computational geometry

65N50: Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs

Related Items

Local refinement based on the 7-triangle longest-edge partition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A mesh-refinement scheme for finite element computations
• Local refinement of simplicial grids based on the skeleton
• A 3D refinement/derefinement algorithm for solving evolution problems
• Mesh quality improvement and other properties in the four-triangles longest-edge partition
• Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
• A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
• A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
• Efficient refinement/derefinement algorithm of nested meshes to solve evolution problems
• An algorithm for adaptive refinement of triangular element meshes
• The 4-triangles longest-side partition of triangles and linear refinement algorithms
• Simple algorithm for adaptive refinement of three-dimensional finite element tetrahedral meshes