On the non-degeneracy property of the longest-edge trisection of triangles

DOI10.1016/j.amc.2010.01.093zbMath1189.65292OpenAlexW2061087896MaRDI QIDQ969154

José P. Suárez, Ángel Plaza, Sergio Falcon

Publication date: 11 May 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10553/54534

zbMATH Keywords

finite element methodnumerical examplesgrid generationmesh qualitytrisectiontriangle subdivision

Mathematics Subject Classification ID

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)

Related Items (7)

On the maximum angle condition for the conforming longest-edge \(n\)-section algorithm for large values of \(n\) ⋮ On Numerical Regularity of Trisection-Based Algorithms in 3D ⋮ Proving the non-degeneracy of the longest-edge trisection by a space of triangular shapes with hyperbolic metric ⋮ 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 ⋮ Properties of the longest-edge \(n\)-section refinement scheme for triangular meshes ⋮ Longest-edge \(n\)-section algorithms: properties and open problems

Uses Software

• PLTMG

Cites Work

• Unnamed Item
• Bounded flatness in \(Q\)-triangulated regular \(n\)-simplexes
• Adaptive refinement of unstructured finite-element meshes
• Quality-improved local refinement of tetrahedral mesh based on element-wise refinement switching.
• Local refinement of simplicial grids based on the skeleton
• Mesh quality improvement and other properties in the four-triangles longest-edge partition
• Non-degeneracy study of the 8-tetrahedra longest-edge partition
• Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
• Propagation of longest-edge mesh patterns in local adaptive refinement
• On the Bisection Method for Triangles
• Mesh Refinement Processes Based on the Generalized Bisection of Simplices
• On Faster Convergence of the Bisection Method for all Triangles
• Adaptivity and mesh generation
• Automatic mesh generation method for shallow water flow analysis
• A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
• On Faster Convergence of the Bisection Method for Certain Triangles

This page was built for publication: On the non-degeneracy property of the longest-edge trisection of triangles