| 1.1.1.
Unorganized point set |
| |
(1)
£\ shapes
(2) £^-regular shapes |
| 1.1.2.
Patches (2D)/Profiles (1D) |
| |
(1)
NURBS
(2) Ferguson patch
(3) Coon¡¦s patch |
| 1.1.3.
Surface-surface intersection |
| |
(1)
Linear intersection
(2) Normal tracking |
| 1.1.4.
Data Structure |
| |
(1)
Euclidean coordinates
(2) Geometrical spline parameters
(3) Element /Edge connectivity (1-3D)
(4) Other geometry attributes: areas, volumes, face normal. |
1.2.
Stitching
1.3.
Information Noises treatment
1.4. Interpolation methods
2.
Unstructured Grid
2.1. Triangular and Tetrahedral
Meshes
| 2.1.1.
Delaunay Triangulation |
| |
(1)
Bowyer approach
(2) Boundary recovery |
| 2.1.2.
Viscous Meshing |
| |
(1)
normal layers
(2) Iso-surface |
| 2.1.3.
Mesh cosmetic |
| |
(1)
smoothing
(2) edge swapping |
2.2.
Quadrilateral and hexahedral Meshes
| 2.2.1.
Agglomeration from triangular meshes |
| |
(1)
smoothing
(2) 2t -> 1q (2D)
(3) 5t -> 1h (3D ??) might require to straighten the
folded surfaces. |
| 2.2.2.
Mesh cosmetic |
| |
(1)
smoothing
Ć Average sweeping (heuristic)
Ć Laplacian
(2) edge swapping 2D (cross the other boundary of the neighboring
cells)
(3) 1e->3e (+1p) 2D
(4) 1e->4e (+1p) 2D
(5) 1e->5e (+4p) 2D
(6) 2e -> 1e (-1p) 2D |
| 2.2.3.
Patch methods |
2.3.
Hybrid Meshes
2.4. Data Structure
3.
Structured Grid
3.1 Multi-block Meshing
3.2 Boundary Treatment
4.
Parallel Issues
4.1 Domain Decomposition4.1 Domain Decomposition
4.1.1. METIS
4.1.2. Jostle
4.2
Data Structure
5.
Library and Filters
5.1. Coding Convention
5.2. Document format for the library
5.3. Data format for the library
5.4. Filters and Protocol
