On the maximum angle condition for the conforming longest-edge \(n\)-section algorithm for large values of \(n\)
Publication:1632306
DOI10.1016/J.CAGD.2014.12.001zbMath1417.65206OpenAlexW2000724411MaRDI QIDQ1632306
Sergey Korotov, José P. Suárez, Ángel Plaza
Publication date: 14 December 2018
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cagd.2014.12.001
finite element methodmesh refinementmaximum angle conditionminimum angle conditionconforming longest-edge \(n\)-section
Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Interpolation in approximation theory (41A05) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Properties of the longest-edge \(n\)-section refinement scheme for triangular meshes
- A geometric diagram and hybrid scheme for triangle subdivision
- On semiregular families of triangulations and linear interpolation
- On the non-degeneracy property of the longest-edge trisection of triangles
- Sard kernel theorems on triangular domains with application to finite element error bounds
- On the finite element method
- On the Angle Condition in the Finite Element Method
This page was built for publication: On the maximum angle condition for the conforming longest-edge \(n\)-section algorithm for large values of \(n\)