A new proof of the degeneracy property of the longest-edge n-section refinement scheme for triangular meshes
From MaRDI portal
Publication:2250267
Recommendations
- Properties of the longest-edge \(n\)-section refinement scheme for triangular meshes
- Properties of triangulations obtained by the longest-edge bisection
- On the non-degeneracy property of the longest-edge trisection of triangles
- 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\)
Cites work
- A geometric diagram and hybrid scheme for triangle subdivision
- A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
- Mesh quality improvement and other properties in the four-triangles longest-edge partition
- On the Angle Condition in 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
- Proving the non-degeneracy of the longest-edge trisection by a space of triangular shapes with hyperbolic metric
- The 4-triangles longest-side partition of triangles and linear refinement algorithms
- The maximum angle condition in the finite element method for monotone problems with applications in magnetostatics
Cited in
(8)- On the maximum angle condition for the conforming longest-edge \(n\)-section algorithm for large values of \(n\)
- Corrigendum to: ``A new proof of the degeneracy property of the longest-edge \(n\)-section refinement scheme for triangular meshes
- On Zlámal minimum angle condition for the longest-edge n-section algorithm with n 4
- Two-sided estimation of diameters reduction rate for the longest edge \(n\)-section of triangles with \(n\geqslant 4\)
- Properties of triangulations obtained by the longest-edge bisection
- The limit property for the interior solid angles of some refinement schemes for simplicial meshes
- Properties of the longest-edge \(n\)-section refinement scheme for triangular meshes
- Longest-edge \(n\)-section algorithms: properties and open problems
This page was built for publication: A new proof of the degeneracy property 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 Q2250267)