Bounds of sub-triangles
Amalia Adlerteg, Linus Carlsson
TL;DR
This work analyzes angle propagation under the longest-edge trisection (LE3) in triangulations used for mesh refinement. By modeling triangles in a normalized complex-plane framework and leveraging conformal (Möbius) normalizations alongside the Poincaré half-plane metric, the authors derive both analytic and numerical bounds on the largest angle in LE3-generated triangles. They prove an explicit analytic bound $\gamma'\le\gamma\cdot c$ with $c=\dfrac{\arccos\left(-\frac{5}{2\sqrt{7}}\right)}{\pi/3}\approx2.6816$ for $z$ in the region $\Omega_1$, and establish a numerical bound $\gamma'<2.1652\gamma$ within $\Omega_2$. These results confirm the existence of a global upper bound on the largest angle produced by LE3, aiding reliable angle control in adaptive triangulations and finite element analyses.
Abstract
We show upper and lower bounds for angles in iterations of trisections of certain triangulations.
