Tetrahedral grid refinement

被引：158

作者：

Bey, J

机构：

[1] Mathematisches Institut, Universität Tübingen, Tübingen, D-72076

来源：

COMPUTING | 1995年 / 55卷 / 04期

关键词：

tetrahedral grid refinement; stable refinements; consistent triangulations; green closure; grid coarsening;

D O I：

10.1007/BF02238487

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We present a refinement algorithm for unstructured tetrahedral grids which generates possibly highly non-uniform but nevertheless consistent (closed) and stable triangulations. Therefore we first define some local regular and irregular refinement rules that are applied to single elements. The global refinement algorithm then describes how these local rules can be combined and rearranged in order to ensure consistency as well as stability. It is given in a rather general form and includes also grid coarsening.

引用

页码：355 / 378

页数：24

共 19 条

[1]

BAENSCH E, 1991, IMPACT COMPUT SCI EN, V3, P181

[2]

Bank R.E., 1983, SCI COMPUT APPL MATH, P3

[3]

Bank RE, 1990, PLTMG SOFTWARE PACKA

[4]

BASTIAN P., 1994, THESIS U HEIDELBERG

[5]

BEY J, 1994, AGM3D MANUAL

[6]

BEY J, THESIS U TUBINGEN

[7]

BEY J, 1991, THESIS I GEOMETRIE P

[8] ADAPTIVE MULTILEVEL METHODS IN 3 SPACE DIMENSIONS [J].

BORNEMANN, F ;

ERDMANN, B ;

KORNHUBER, R .

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 1993, 36 (18) :3187-3203

[9]

BRAMBLE JH, 1991, MATH COMPUT, V57, P23, DOI 10.1090/S0025-5718-1991-1079008-4

[10]

Ciarlet P. G., 2002, FINITE ELEMENT METHO

← 1 2 →