Lectures 12 and 13: Mesh Generation - User page server for...
Transcript of Lectures 12 and 13: Mesh Generation - User page server for...
![Page 1: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/1.jpg)
58:110 Computer-Aided Engineering
Mesh Generation
Reference: Lecture Notes on Delaunay Mesh Generation, J. Shewchuk (1999)
![Page 2: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/2.jpg)
Desirable Mesh Properties
1. Compatible with solver
• Finite-difference solver requires mesh to follow lines of constant coordinate
• Most finite-element and finite-volume codes are written only for grid elements of certain shapes (e.g., tetrahedron, hexahedral, etc.)
![Page 3: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/3.jpg)
2. Nodes of adjacent mesh elements are the same
Examples of meshes that are not allowed
![Page 4: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/4.jpg)
3. Element angles close to 90 degrees• Meshes with angles that are too small or too
large lead to inaccurate solutions, ill-conditioned matrices, and slow (or no) convergence of iterative solvers
Poor Mesh Good Mesh
![Page 5: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/5.jpg)
4. Provides adequate resolution of computed fields
• Meshes must be finer in fluid/thermal boundary layers, near cracks in solids, near joints, within vortex cores, etc.
U
![Page 6: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/6.jpg)
5. Uses minimum number of elements
• Triangles use twice as many elements as quadralaturals
• Tetrehedrals use six times as many elements as hexahedrals
1
2
31
2
![Page 7: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/7.jpg)
6. Easily refinable
• We often want to do tests of resolution by varying the grid size in some systematic manner
• Useful property for multigrid matrix iteration solvers and multiscale computational approaches
![Page 8: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/8.jpg)
7. Easy to generate
• Triangles and tetrahedrons are easy to generate using automatic grid generators
• Depends on capabilities of grid generators
![Page 9: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/9.jpg)
Types of MeshesA. Structured
• A set of indices (i,j,k) exist, with the number of indices equal to the space dimension, such that each element has a unique index set in which the indices of adjacent elements differ by at most unity in each index
![Page 10: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/10.jpg)
(1,1)
(1,2)
(1,3)
(1,4)
(1,5)
Example Structured Mesh
(2,1)
(3,1)
(4,1)(5,1)
![Page 11: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/11.jpg)
A.1. Body-Fitted
• Structured mesh in which lines connecting nodes lie on constant coordinate surfaces of some coordinate system
• Required for finite-difference solver
Flow past a sphere – done using a spherical coordinate body-fitted grid
![Page 12: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/12.jpg)
A.2. Multi-Block
• Mesh formed by joining together several structured meshes
Vortex-Blade Interaction
![Page 13: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/13.jpg)
A.3 Chimera Mesh• Chimera meshes are formed from two structured
meshes that overlap. They are used to provide enhanced local resolution with structured meshes. The user must continually interpolate from one mesh to the other during the problem solution.
![Page 14: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/14.jpg)
B. Unstructured
• Mesh formed by connecting lines between nodes, such that no nodes are contained within elements
• Unstructured meshes provide greater freedom in providing fine resolution to one region, but having course resolution in other areas
• Unstructured meshes significantly reduce the number of nodal points
• Some solvers do not function as well with unstructured meshes as they do with structured or block-structured meshes
![Page 15: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/15.jpg)
Structured and Unstructured Meshes
Mesh for earthquake prediction in Los Angeles Basin: Structured mesh has five times as many nodes, but yields same accuracy in numerical simulation as the unstructured mesh
![Page 16: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/16.jpg)
Delaunay Triangularization• Method for automatic generation of an “optimal”
unstructured mesh given a set of N points• Property: Delaunay triangularization maximizes
the minimum angle among all possible triangularizations of a set of points
Example of Delaunaytriangularization
![Page 17: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/17.jpg)
Given: Set of N points, denoted by V
Triangularization (T): A trangularization of V is a set of triangles T
• whose vertices coincide with V • whose interiors do not overlap each other• who contain no points of V within the interior of
any triangle
There exist many different triangularizations of a given set of points.
![Page 18: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/18.jpg)
Geometrical ConceptsCircumcircle: A circle passing through two points
u and v
Any two points have an infinite number of circumcircles
![Page 19: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/19.jpg)
Delaunay Triangularization (D)
Definition: A Delaunay triangularization is a set of triangles T in which each edge of T possesses at least one empty circumcircle.
Empty: A circumcircle is said to be empty if it contains no nodes of the set V
Not Empty EmptyNot Empty
![Page 20: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/20.jpg)
Delaunay Triangles
Circumcircle of a triangle = circle passing through all three vertices of the triangle
![Page 21: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/21.jpg)
Delaunay TrianglesDefinition: A triangle is Delaunay with respect to a
set of points V if its circumcircle is empty
Theorem: A triangle is Delauney iff each of its edges are Delaunay
If a triangle is not Delaunay, then one of its edges (in this case edge e) is not Delaunay.
![Page 22: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/22.jpg)
Min-Containment Circle
Definition: The min-containment circle is the smallest circle that contains all vertices of a triangle.
![Page 23: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/23.jpg)
Existence and Uniqueness of Delaunay Triangularization
• It is unique (i.e.,only one triangularizationis Delaunay for a given set of points V)
• It is guaranteed to exist provided that there are no four points that all lie on a circle
![Page 24: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/24.jpg)
Extremum Properties of Delaunay Triangularization
Among all triangularizations T, the Delaunaytriangularization:
• maximizes the minimum angle in T• minimizes the largest circumcircle in T • minimizes the largest min-containment
circle in T
![Page 25: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/25.jpg)
Algorithm for Forming a DelaunayTriangularization
1. Start with two points along the side to make an edge
2. Search surrounding points to see if they form a Delaunay triangle with the edge
3. Go to one of the new edges of this triangle and repeat
Note: The calculation can be significantly speeded up by using a background Cartesian grid to help identify nearby points
![Page 26: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/26.jpg)
Advancing Fronts
When meshing the exterior of an object, start with edges on the object and search outward to find triangles.
Several stages in the progression of an advancing front algorithm
![Page 27: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/27.jpg)
Example of Mesh Produced Using an Advancing Front Algorithm
![Page 28: Lectures 12 and 13: Mesh Generation - User page server for …user.engineering.uiowa.edu/~cae1/Presentations/Meshing.pdf · B. Unstructured • Mesh formed by connecting lines between](https://reader034.fdocuments.in/reader034/viewer/2022051508/5abad9667f8b9ad1768c03d3/html5/thumbnails/28.jpg)
Delaunay Tetrehedralization
The 3D version of Delaunay triangularization