On Zlámal minimum angle condition for the longest-edge \(n\)-section algorithm with \(n \geq 4\)

DOI10.1007/978-3-319-96415-7_68zbMath1427.65397OpenAlexW2908377566MaRDI QIDQ2008749

José P. Suárez, Sergey Korotov, Tania Moreno, Ángel Plaza

Publication date: 26 November 2019

Full work available at URL: https://doi.org/10.1007/978-3-319-96415-7_68

Mathematics Subject Classification ID

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

This page was built for publication: On Zlámal minimum angle condition for the longest-edge \(n\)-section algorithm with \(n \geq 4\)