Adaptive Mesh Refinement for Arbitrary Initial Triangulations
Lars Diening, Lukas Gehring, Johannes Storn · Foundations of Computational Mathematics · 2025
Abstract We introduce a simple initialization of the Maubach bisection routine for adaptive mesh refinement which applies to any conforming initial triangulation and terminates in linear time with respect to the number of initial vertices. We show that Maubach’s routine with this initialization always terminates and generates meshes that preserve shape regularity and satisfy the closure estimate needed for optimal convergence of adaptive schemes. Our ansatz allows for the intrinsic use of existing implementations.