A weak compatibility condition for Newest Vertex Bisection in any dimension
We defne a weak compatibility condition for the Newest Vertex Bisection algorithm on simplex grids of any dimension and show that, using this condition, the iterative refnement algorithm terminates successfully. Additionally we provide an O(n) algorithm that renumbers any simplex grid to fulfll this condition. Furthermore we conduct experiments to estimate the distance to the standard compatibilit