On the maximum angle condition for the conforming longest-edge n-section algorithm for large values of n

DOI10.1016/J.CAGD.2014.12.001MaRDI QIDQ1632306zbMATH OpenOpenAlexFDO

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

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

zbMATH Keywords

conforming longest-edge \(n\)-sectionfinite element methodmaximum angle conditionmesh refinementminimum angle condition

Mathematics Subject Classification ID

Interpolation in approximation theory (41A05) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Recommendations

• On Zlámal minimum angle condition for the longest-edge n-section algorithm with n 4
• Longest-edge \(n\)-section algorithms: properties and open problems
• Properties of the longest-edge \(n\)-section refinement scheme for triangular meshes
• Improved maximum angle estimate for longest-edge bisection
• A new proof of the degeneracy property of the longest-edge \(n\)-section refinement scheme for triangular meshes

Cites work

• A geometric diagram and hybrid scheme for triangle subdivision
• scientific article; zbMATH DE number 3540328 (Why is no real title available?)
• scientific article; zbMATH DE number 3596197 (Why is no real title available?)
• scientific article; zbMATH DE number 3300288 (Why is no real title available?)
• On semiregular families of triangulations and linear interpolation
• On the Angle Condition in the Finite Element Method
• On the finite element method
• On the non-degeneracy property of the longest-edge trisection of triangles
• Properties of the longest-edge \(n\)-section refinement scheme for triangular meshes
• Sard kernel theorems on triangular domains with application to finite element error bounds

Cited in

(3)

• On Zlámal minimum angle condition for the longest-edge n-section algorithm with n 4
• Improved maximum angle estimate for longest-edge bisection
• Longest-edge \(n\)-section algorithms: properties and open problems

This page was built for publication: On the maximum angle condition for the conforming longest-edge \(n\)-section algorithm for large values of \(n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1632306)