Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2601.13663 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908977382555648 |
|---|---|
| author | Kalmanovich, Daniel Solomon, Yaar |
| author_facet | Kalmanovich, Daniel Solomon, Yaar |
| contents | The Longest Edge Bisection of a triangle is performed by joining the midpoint of its longest edge to the opposite vertex. Applying this procedure iteratively produces an infinite family of triangles. Surprisingly, a classical result of Stynes (1980) shows that for any initial triangle, the elements of this infinite family fall into finitely many similarity classes.
While the set of classes is finite, it turns out that a far smaller, periodic subset of ``fat'' triangles effectively dominates the final mesh structure. This subset is comprised of periodic orbits of length four, which we refer to as {\bf terminal quadruples}. We prove the following asymptotic area distribution result: for every initial triangle, the portion of area occupied by these terminal quadruples tends to one, with the convergence occurring at an exponential rate. In fact, we provide the precise distribution of triangles in every step. We introduce the {\bf bisection graph} and use spectral methods to prove this result.
Given this dominance, we provide a complete characterization of triangles possessing a single terminal quadruple, while conversely exhibiting a sequence of triangles with an unbounded number of terminal quadruples. Furthermore, we reveal several fundamental geometric properties of the points of a terminal quadruple, laying the groundwork for studying the geometric distribution of the entire orbit. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_13663 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On the stability, complexity, and distribution of similarity classes of the longest edge bisection process for triangles Kalmanovich, Daniel Solomon, Yaar Computational Geometry Combinatorics 65N50, 05C50, 37N30, 15B48 The Longest Edge Bisection of a triangle is performed by joining the midpoint of its longest edge to the opposite vertex. Applying this procedure iteratively produces an infinite family of triangles. Surprisingly, a classical result of Stynes (1980) shows that for any initial triangle, the elements of this infinite family fall into finitely many similarity classes. While the set of classes is finite, it turns out that a far smaller, periodic subset of ``fat'' triangles effectively dominates the final mesh structure. This subset is comprised of periodic orbits of length four, which we refer to as {\bf terminal quadruples}. We prove the following asymptotic area distribution result: for every initial triangle, the portion of area occupied by these terminal quadruples tends to one, with the convergence occurring at an exponential rate. In fact, we provide the precise distribution of triangles in every step. We introduce the {\bf bisection graph} and use spectral methods to prove this result. Given this dominance, we provide a complete characterization of triangles possessing a single terminal quadruple, while conversely exhibiting a sequence of triangles with an unbounded number of terminal quadruples. Furthermore, we reveal several fundamental geometric properties of the points of a terminal quadruple, laying the groundwork for studying the geometric distribution of the entire orbit. |
| title | On the stability, complexity, and distribution of similarity classes of the longest edge bisection process for triangles |
| topic | Computational Geometry Combinatorics 65N50, 05C50, 37N30, 15B48 |
| url | https://arxiv.org/abs/2601.13663 |