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

DOI10.1016/J.AMC.2010.01.093MaRDI QIDQ969154zbMATH OpenOpenAlexFDO

Authors Ángel Plaza, José P. Suárez, 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

numerical examplesfinite element methodmesh qualitygrid generationtrisectiontriangle 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)

Recommendations

• Proving the non-degeneracy of the longest-edge trisection by a space of triangular shapes with hyperbolic metric
• Properties of triangulations obtained by the longest-edge bisection
• Local refinement based on the 7-triangle longest-edge partition
• Properties of the longest-edge \(n\)-section refinement scheme for triangular meshes
• On numerical regularity of trisection-based algorithms in 3D

Cites work

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

Cited in

(9)

• Properties of triangulations obtained by the longest-edge bisection
• Longest-edge \(n\)-section algorithms: properties and open problems
• Proving the non-degeneracy of the longest-edge trisection by a space of triangular shapes with hyperbolic metric
• Two-sided estimation of diameters reduction rate for the longest edge \(n\)-section of triangles with \(n\geqslant 4\)
• On numerical regularity of trisection-based algorithms in 3D
• 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
• On the maximum angle condition for the conforming longest-edge \(n\)-section algorithm for large values of \(n\)
• A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection

Describes a project that uses

Uses Software

• PLTMG

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

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