Closure complexity of longest-edge bisection for triangular meshes

DOI10.48550/ARXIV.2609.04003MaRDI QIDQ7285209arXivFDO

Authors Zhiyuan Yang, Yu-Wen Li, Yuwen Li

Publication date 3 September 2026

Published in arXiv

Tldr We analyze the longest-edge bisection method with serial propagation-path closure on triangular meshes. The main contribution is the proof of a cumulative closure estimate showing that the number of triangles grows at most by a factor proportional to the total number of marks in any adaptive mesh sequence.

Full work available at URL https://doi.org/10.48550/ARXIV.2609.04003

Mathematics Subject Classification ID

Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Complexity and performance of numerical algorithms (65Y20)

arXiv classification

math.NA

Cites work

• 30 years of newest vertex bisection
• A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
• Adaptive finite element methods with convergence rates
• Adaptive Mesh Refinement for arbitrary initial Triangulations
• Complexity of the bisection method
• Mesh Refinement Processes Based on the Generalized Bisection of Simplices
• On Faster Convergence of the Bisection Method for all Triangles
• On the stability, complexity, and distribution of similarity classes of the longest edge bisection process for triangles
• The completion of locally refined simplicial partitions created by bisection
• The Constant in the Theorem of Binev-Dahmen-DeVore-Stevenson and a Generalisation of it
• The longest-edge bisection algorithm may produce degenerating tetrahedra

This page was built for publication: Closure complexity of longest-edge bisection for triangular meshes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285209)