3 papers
cs.CG2026
On Triangulations Generated by the Largest-Angle -Section Algorithm
Jérôme Michaud, Sergey Korotov
We define a mesh refinement algorithm based on the rule of dividing the largest angles of triangular elements of planar partitions in focus into equal parts, and analyse the (g…
math.NA2026
Dynamics of the Longest-Edge Altitude Bisection Algorithm
Jérôme Michaud, Sergey Korotov
We study a longest-edge based refinement scheme for triangulations, termed the longest-edge altitude bisection (LEAB), in which each triangle is subdivided by dropping the altitude…
math.NA2025
On the Orbits of Similarity Classes of Tetrahedra Generated by the Longest-Edge Bisection Algorithm
Jérôme Michaud, Sergey Korotov
In this work, we study the dynamics of similarity classes of tetrahedra generated by the longest-edge bisection (LEB) algorithm. Building on the normalization strategy introduced b…