A Weak Compatibility Condition for Newest Vertex Bisection in Any Dimension
Martin Alkämper, Fernando Gaspoz, Robert Klöfkorn · SIAM Journal on Scientific Computing · 2018
We define a weak compatibility condition for the Newest Vertex Bisection algorithm on simplex grids of any dimension and show that, using this condition, the iterative refinement algorithm terminates successfully. Additionally we provide an $O(n)$ algorithm that renumbers any simplex grid to fulfill this condition. Furthermore we conduct experiments to estimate the distance to the standard compatibility and also study the geometric quality of the produced meshes.