A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection
From MaRDI portal
Publication:2229910
DOI10.1016/j.matcom.2014.08.002OpenAlexW1964214543MaRDI QIDQ2229910
Eduardo Quevedo, José P. Suárez, Francisco Perdomo, Ángel Plaza
Publication date: 18 February 2021
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.matcom.2014.08.002
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Properties of the longest-edge \(n\)-section refinement scheme for triangular meshes
- A geometric diagram and hybrid scheme for triangle subdivision
- 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
- Local refinement based on the 7-triangle longest-edge partition
- Adaptive refinement of unstructured finite-element meshes
- On global and local mesh refinements by a generalized conforming bisection algorithm
- Local refinement of simplicial grids based on the skeleton
- Complexity of the bisection method
- Mesh quality improvement and other properties in the four-triangles longest-edge partition
- 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
- A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
- A Proof of Convergence and an Error Bound for the Method of Bisection in R n
- On Faster Convergence of the Bisection Method for Certain Triangles
- Glimpses of Algebra and Geometry
This page was built for publication: A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection
