Largest-Angle Bisection and Statistical Regularization of Triangle Shapes
Abstract
Largest-angle bisection (LAB) repeatedly divides a triangle by bisecting its largest angle. Although this procedure is known to preserve nondegenerate triangle shapes, less is known about the distribution of shapes across the resulting refinement tree. We show that its long-term behavior is governed by a distinction between pure and mixed branches. A branch that eventually selects only one of the two children may approach an exceptional family of shapes. By contrast, every branch that changes children infinitely often converges in shape to a right-isosceles triangle. This follows from a projective Lyapunov function that is non-increasing at every refinement and decreases strictly whenever the selected child changes. Consequently, a random branch converges to the right-isosceles shape with probability one, and the proportion of triangles near that shape tends to one across complete refinement levels. Largest-angle bisection therefore produces statistical regularization even though exceptional branches remain present.
Related
- Largest-dihedral-angle bisection algorithm does not preserve mesh regularity for tetrahedral partitions
- The reverse isoperimetric inequality for convex shapes included in a triangle
- Fisher Completions and Statistical Regularization of Wrapped Gaussian Families
- Uniform Statistical Convergence of Empirical Sinkhorn Potentials with Exponential and Polynomial Dependence on the Regularization Parameter
- Degenerating orbits of the Longest Edge Bisection process
BibTeX
@misc{michaud2026largestangle,
title = {{Largest-Angle Bisection and Statistical Regularization of Triangle Shapes}},
author = {Jérôme Michaud},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.06492},
eprint = {2611.06492},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.06492},
note = {CC BY-NC-ND 4.0},
}
RIS
TY - UNPB
TI - Largest-Angle Bisection and Statistical Regularization of Triangle Shapes
AU - Jérôme Michaud
PY - 2026
DA - 2026/11/04
PB - arXiv
DO - 10.48550/arxiv.2611.06492
UR - https://arxiv.org/abs/2611.06492
AB - Largest-angle bisection (LAB) repeatedly divides a triangle by bisecting its largest angle. Although this procedure is known to preserve nondegenerate triangle shapes, less is known about the distribution of shapes across the resulting refinement tree. We show that its long-term behavior is governed by a distinction between pure and mixed branches. A branch that eventually selects only one of the two children may approach an exceptional family of shapes. By contrast, every branch that changes children infinitely often converges in shape to a right-isosceles triangle. This follows from a projective Lyapunov function that is non-increasing at every refinement and decreases strictly whenever the selected child changes. Consequently, a random branch converges to the right-isosceles shape with probability one, and the proportion of triangles near that shape tends to one across complete refinement levels. Largest-angle bisection therefore produces statistical regularization even though exceptional branches remain present.
ER -