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

DOI10.1016/J.AML.2012.04.014MaRDI QIDQ714517zbMATH OpenOpenAlexFDO

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

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

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) 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

• A new proof of the degeneracy property of the longest-edge \(n\)-section refinement scheme for triangular meshes
• On the non-degeneracy property of the longest-edge trisection of triangles
• Properties of triangulations obtained by the longest-edge bisection
• Mesh quality improvement and other properties in the four-triangles longest-edge partition
• Longest-edge \(n\)-section algorithms: properties and open problems

Cites work

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

Cited in

(13)

• scientific article; zbMATH DE number 1163631 (Why is no real title available?)
• 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
• On the non-degeneracy property of the longest-edge trisection of triangles
• Two-sided estimation of diameters reduction rate for the longest edge \(n\)-section of triangles with \(n\geqslant 4\)
• Triangulation refinement by using edge subdivision
• A new proof of the degeneracy property of the longest-edge \(n\)-section refinement scheme for triangular meshes
• The limit property for the interior solid angles of some refinement schemes for simplicial meshes
• Improved maximum angle estimate for longest-edge bisection
• On the adjacencies of triangular meshes based on skeleton-regular partitions
• On Zlámal minimum angle condition for the longest-edge n-section algorithm with n 4
• 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

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

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