Properties of the longest-edge \(n\)-section refinement scheme for triangular meshes

DOI10.1016/J.AML.2012.04.014zbMath1252.65199OpenAlexW2057749005MaRDI QIDQ714517

Tania Moreno, José P. Suárez, Ángel Plaza, Pilar Abad

Publication date: 11 October 2012

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2012.04.014

zbMATH Keywords

finite elementstriangle meshesrefinement schemelongest-edge \(n\)-sectionminimum interior angletriangle \(n\)-sectiontriangle partition

Mathematics Subject Classification ID

Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Related Items (6)

On the maximum angle condition for the conforming longest-edge \(n\)-section algorithm for large values of \(n\) ⋮ Improved Maximum Angle Estimate for Longest-Edge Bisection ⋮ The limit property for the interior solid angles of some refinement schemes for simplicial meshes ⋮ A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection ⋮ A new proof of the degeneracy property of the longest-edge \(n\)-section refinement scheme for triangular meshes ⋮ Longest-edge \(n\)-section algorithms: properties and open problems

Cites Work

• On the non-degeneracy property of the longest-edge trisection of triangles
• A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side

This page was built for publication: Properties of the longest-edge \(n\)-section refinement scheme for triangular meshes