A Weak Compatibility Condition for Newest Vertex Bisection in any dimension
Numerical Analysis
2017-11-10 v1 Numerical Analysis
Abstract
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 algorithm terminates successfully. Additionally we provide an O(n) algorithm that renumbers any simplex grid to fulfil this condition. Furthermore we conduct experiments to estimate the distance to the standard compatibility and also the geometric quality of the produced meshes.
Cite
@article{arxiv.1711.03141,
title = {A Weak Compatibility Condition for Newest Vertex Bisection in any dimension},
author = {Martin Alkämper and Fernando Gaspoz and Robert Klöfkorn},
journal= {arXiv preprint arXiv:1711.03141},
year = {2017}
}
Comments
18 pages