George P.-L., Borouchaki H. — Delauney Triangulation and Meshing: Application to Finite Elements :: Электронная библиотека попечительского совета мехмата МГУ

Главная Ex Libris Книги Журналы Статьи Серии Каталог Wanted Загрузка ХудЛит Справка Поиск по индексам Поиск Форум

Авторизация

Поиск по указателям

George P.-L., Borouchaki H. — Delauney Triangulation and Meshing: Application to Finite Elements

Обсудите книгу на научном форуме

Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter

Название: Delauney Triangulation and Meshing: Application to Finite Elements

Авторы: George P.-L., Borouchaki H.

Аннотация:

The authors describe meshing techniques based on Delauney triangulation, which is used in construction projects. They also discuss classical mesh generation techniques and more advanced topics such as isotop, planar, curve surface and volumetric testing. The theoretical discussion is complemented by examples of practical applications.

Язык:

Рубрика: Computer science/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1998

Количество страниц: 412

Добавлена в каталог: 07.12.2008

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID

Предметный указатель

$P^{1}$ -approximation      278
$P^{2}$ -approximation      283
(ideal) control space      138
A posteriori partitioning      370
A priori partitioning      371
Adaptation      243
Adjacency graph      16
Advancing-front method      137 150 200 204
Algebraic method      369
Arbitrary position (points in)      13
Aspect ratio      8
assembly      281
Ball      23 91
Base      23
Bernstein polynomial      305
Bezier curve      305
Boundary condition      281
Catalan number      224
Cavity      24 52
circumcircle      6
Circumsphere      10
Collision      31 62
Compatible mesh      246
complexity      50
Conformal triangulation      14
Connectivity      244
Connectivity matrix      16 59
Constrained Delaunay triangulation      85
CONSTRAINED TRIANGULATION      20 74
Control space      138
Convex hull      68
Covering      14
Curvature      167
Cylindrical mesh      187
Data structure      277
Dehn — Sommerville (formula)      14
Delaunay admissible edge      77
Delaunay admissible face      74
Delaunay kernel      41
Delaunay lemma      38
Delaunay measure      45 123
Delaunay triangulation      18
Dihedral angle      222
Divide and conquer      47
Dynamic coloring      26
Dynamic constraint      110
Edge swapping      46 151 223
Empty mesh      132 196
Empty sphere criterion      18
Equivalent triangulation      75
Euler formula      14
Filtration      142 147 202 205
Finite differences      139
Finite element      279
First fundamental form      164
Firtree      224
General pipe      24 25 87 92
General position (points in)      13
Geodesic      115
Geometric attribute      283
Gregory patch      315
h-method      245
Hashing      30
HCT finite element      316
hp-method      247
Ideal control space      138
incircle      7
Incremental method      41
Inductive Delaunay triangulation      371 374
Infinite precision      55
inheritance      58 128
Inscribed circle      7
Insphere      11
Kernel      89 230

Kernel of a polygon      44
Laplacian smoothing      231
Lazy triangulation      100
Little circle      109
Local base      164
Local principal base      168
Localization search      70
Medial axis      160 367
Medial surface      213 367
mesh      20 280 281
Mesh intersection      261
Metric      115
Metric interpolation      253
Metric intersection      116 255
Metric simultaneous reduction      322
Multiple metric      116
Node      281
Non obtuse mesh      242
Octree      62 192 200
Optimization      215
Orthogonal mesh      243
Osculating circle      170
Over-connected edge      230
Over-connected point      229
Over-constrained edge      242
Over-constrained element      242
P-method      245
Parallel computing      370
Pebble      96
Periodic mesh      159 187 213 296
Physical attribute      282
pipe      24 87 92
Polytope      13
Principal directions      167
Quadtree      62 137 139
Quality      8 22
r-method      244
Randomization      57 142
Reduced incremental method      45
Reflex edge      112
Regular tetrahedron      12
Schoenhart polyhedron      89
Second fundamental form      167
Seed      135
Separating power      54
Separation power      57
Shape quality      216
Shell      25 90
Simple polygon      83
simplex      13
Simultaneous reduction of two quadratic forms      117
Size quality      217
Skeleton      160 214 367
Solid angle      222
Star-shaped polygon      44
Star-shaped polyhedron      44
Steiner point      89 196 202
Stereographic projection      187
Surface roughness      381
Sweeping algorithm      49
target value      22 209
tetrahedron      9
triangle      5
Triangulation      14 281
Under-connected edge      230
Under-connected point      229
Validity of a mesh      22
Validity of a triangulation      17
Variational formulation      279
Variogram      137
Vertex valance      229
Voronoie cells      371
Voronoie diagram      35
Voyeur      16
Weakly equivalent triangulation      76

О проекте