A weak compatibility condition for Newest Vertex Bisection in any dimension

M. Alkämper; Fernando Gaspoz; Robert Klöfkorn

doi:10.1137/17M1156137

A weak compatibility condition for Newest Vertex Bisection in any dimension

M. Alkämper, Fernando Gaspoz, Robert Klöfkorn

Research output: Contribution to journal › Article › peer-review

Abstract

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 compatibility and also study the geometric quality of the produced meshes.

Original language	English
Pages (from-to)	A3853-A3872
Journal	SIAM Journal on Scientific Computing
Volume	40
Issue number	6
DOIs	https://doi.org/10.1137/17M1156137
Publication status	Published - 2018 Jan
Externally published	Yes

Free keywords

Adaptive method
Mesh generation
Mesh refnement
Newest Vertex Bisection

Access to Document

10.1137/17M1156137

Cite this

@article{0db8d70e7dd043a982201d4a2ce69b3c,

title = "A weak compatibility condition for Newest Vertex Bisection in any dimension",

abstract = "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 compatibility and also study the geometric quality of the produced meshes.",

keywords = "Adaptive method, Mesh generation, Mesh refnement, Newest Vertex Bisection",

author = "M. Alk{\"a}mper and Fernando Gaspoz and Robert Kl{\"o}fkorn",

year = "2018",

month = jan,

doi = "10.1137/17M1156137",

language = "English",

volume = "40",

pages = "A3853--A3872",

journal = "SIAM Journal on Scientific Computing",

issn = "1064-8275",

publisher = "Society for Industrial and Applied Mathematics",

number = "6",

}

TY - JOUR

T1 - A weak compatibility condition for Newest Vertex Bisection in any dimension

AU - Alkämper, M.

AU - Gaspoz, Fernando

AU - Klöfkorn, Robert

PY - 2018/1

Y1 - 2018/1

N2 - 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 compatibility and also study the geometric quality of the produced meshes.

AB - 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 compatibility and also study the geometric quality of the produced meshes.

KW - Adaptive method

KW - Mesh generation

KW - Mesh refnement

KW - Newest Vertex Bisection

U2 - 10.1137/17M1156137

DO - 10.1137/17M1156137

M3 - Article

AN - SCOPUS:85060057787

SN - 1064-8275

VL - 40

SP - A3853-A3872

JO - SIAM Journal on Scientific Computing

JF - SIAM Journal on Scientific Computing

IS - 6

ER -

A weak compatibility condition for Newest Vertex Bisection in any dimension

Abstract

Free keywords

Access to Document

Fingerprint

Cite this