Mesh Generation: Application to Finite Elements
A survey of the different algorithms and data structures useful for triangulation and meshing construction, including mesh modification tools, mesh evaluation criteria, mesh optimization, adaptive mesh construction, and parallel meshing techniques.
|
Format: Hardcover, English, 816 pages |
Have you read this book? Write your own Review
Write the first review of this book.
Publisher Comments
The numerical simulation of physical problems expressed in terms of partial differential equations (so-called PDE's) using a finite element, finite volume, boundary element, or any other numerical method requires the discretization of the domain of interrest into a set of elements, i.e. a mesh.
The differential equations are approximated by a set of algebraic equations on this mesh, this set being then solved to provide the approximate solution of the partial differential system over the field.
The discretization requires certain properties for the solution to be exploitable and must at least conform to all domain boundaries in order to accurately represent boundary conditions. Consequently, the mesh generation stage, as an essential pre-requisite, is of utmost importance in the computational schemes, as it is related to the convergence of the computational scheme as well as to the accuracy of the numerical solutions.
There is indeed a wide variety of algorithms suitable to produce such meshes. Some of these methods are designed to handle specific geometric situations while others can be used in a more general context. User-driven, semi-automatic as well as fully automatic methods exist leading to structured, unstructured or mixed meshes. The mesh generation problems are mainly related to the boundary meshing and domain meshing issues.
Numerous computational issues muste be carefully addressed for designing reliable and robust meshing algorithms. These issues concern computer-related data structures and algorithms as well as advanced data structures and computational schemes. In this regard, basic computational tools, geometric and dscrete geometric notions, computational and mesh data structures, element and mesh definitions are of significant importance.
The aim of this book is to provide a comprehensive survey of the different algorithms and data structures useful for triangulation and meshing construction. In addition, several aspects will also be described, for instance mesh modification tools, mesh evaluation criteria, mesh optimization, including even adaptative mesh constructions as well as parallel meshing techniques.
Table of Contents
| General introduction | 19 | |
| Synopsis | 22 | |
| Symbols and notations | 25 | |
| 1 | General definitions | 27 |
| 2 | Basic structures and algorithms | 47 |
| 3 | A comprehensive survey of mesh generation methods | 97 |
| 4 | Algebraic, P.D.E. and multiblock methods | 135 |
| 5 | Quadtree-octree based methods | 165 |
| 6 | Advancing-front technique for mesh generation | 201 |
| 7 | Delaunay-based mesh generation methods | 235 |
| 8 | Other types of mesh generation methods | 267 |
| 9 | Medial axis, mid-surface and applications | 295 |
| 10 | Quadratic forms and metrics | 325 |
| 11 | Differential geometry | 355 |
| 12 | Curve modeling | 391 |
| 13 | Surface modeling | 433 |
| 14 | Curve meshing | 461 |
| 15 | Surface meshing and re-meshing | 489 |
| 16 | Meshing implicit curves and surfaces | 521 |
| 17 | Mesh modifications | 553 |
| 18 | Mesh optimization | 585 |
| 19 | Surface mesh optimization | 617 |
| 20 | A touch of finite elements | 653 |
| 21 | Mesh generation and adaptation (h-methods) | 685 |
| 22 | P-methods and hp-methods | 725 |
| 23 | Parallel computing and meshing issues | 743 |
| Bibliography | 767 | |
| Index | 807 | |
