Translate 
Abstract
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.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
