A Weak Compatibility Condition for Newest Vertex Bisection in Any Dimension
| Autor: | Robert Klöfkorn, Martin Alkämper, Fernando D. Gaspoz |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Simplex
65N30 65N50 65N12 Adaptive method Applied Mathematics Computer Science - Numerical Analysis Numerical Analysis (math.NA) 010103 numerical & computational mathematics 01 natural sciences 010101 applied mathematics Combinatorics Computational Mathematics Computer Science::Discrete Mathematics Mesh generation Iterative refinement Compatibility (mechanics) FOS: Mathematics Bisection method Mathematics - Numerical Analysis 0101 mathematics Mathematics |
| Zdroj: | SIAM Journal on Scientific Computing. 40:A3853-A3872 |
| ISSN: | 1095-7197 1064-8275 |
| DOI: | 10.1137/17m1156137 |
| Popis: | 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. 18 pages |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|