On Numerical Regularity of Trisection-Based Algorithms in 3D
From MaRDI portal
Publication:2954441
DOI10.1007/978-3-319-32857-7_35zbMath1355.65033OpenAlexW2508187310MaRDI QIDQ2954441
Pilar Abad, Ángel Plaza, José P. Suárez, Sergey Korotov
Publication date: 13 January 2017
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-32857-7_35
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Longest-edge \(n\)-section algorithms: properties and open problems
- On the equivalence of regularity criteria for triangular and tetrahedral finite element partitions
- On the non-degeneracy property of the longest-edge trisection of triangles
- On the equivalence of ball conditions for simplicial finite elements in \(\mathbf R^d\)
- Relationship between tetrahedron shape measures
- A recursive approach to local mesh refinement in two and three dimensions
- Local refinement of simplicial grids based on the skeleton
- A 3D refinement/derefinement algorithm for solving evolution problems
- Red refinements of simplices into congruent subsimplices
- An analysis of simplex shape measures for anisotropic meshes
- A comparative study between some bisection based partitions in 3D
- Non-degeneracy study of the 8-tetrahedra longest-edge partition
- On \(C^1\)-complexes
- Verification of three-dimensional anisotropic adaptive processes
- Local mesh refinement in 2 and 3 dimensions
- A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
- Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
- Locally Adapted Tetrahedral Meshes Using Bisection
- Quality Local Refinement of Tetrahedral Meshes Based on Bisection
This page was built for publication: On Numerical Regularity of Trisection-Based Algorithms in 3D
