Computational Fluid Dynamics Volume II / Hoffmann Chiang / 17 - 1

Copyright 2001 EES

 Grid Generation
Structured grid
The grid points can be easily identified in an orderly manner
along the grid lines.
Unstructured grid
The grid points, in general, cannot be associated with grid
lines. Therefore, the identification of the grid points must
be individually specified.

Computational Fluid Dynamics Volume II / Hoffmann Chiang / 17 - 2

Copyright 2001 EES

 Structured grids

Advantages

They are relatively easy to generate.

Grid point identification can be easily accomplished.

Disadvantages

A transformation from physical to computational space

is required.

Multi-block grid system may be required.

Computational Fluid Dynamics Volume II / Hoffmann Chiang / 17 - 3

Copyright 2001 EES

 Unstructural grids
Advantages

The grid system can be generated directly on the

physical space.

Disadvantages

Grid point identification is based on individual points.

More difficult to program. That is, the programmer needs

a sound background in data structure arrangement and
experience in data book-keeping skills.

Computational Fluid Dynamics Volume II / Hoffmann Chiang / 17 - 4

Copyright 2001 EES

The advancing front method

The Delaunay method

Computational Fluid Dynamics Volume II / Hoffmann Chiang / 17 - 5

Copyright 2001 EES

 Important features of the scheme:

The scheme is simple and straight forward.

It is relatively easy to implement for numerical applications.

It can triangularize concave domains without any difficulty

or additional effort.
Shortcomings of the scheme:

The scheme is not as efficient as some other schemes.

Control over grid quality is limited.

Grid quality:

Smooth distribution of grid points.

Skewness.
Computational Fluid Dynamics Volume II / Hoffmann Chiang / 17 - 6
Copyright 2001 EES

(a)

(b)

Figure 17-3. Formation of triangular elements.

Computational Fluid Dynamics Volume II / Hoffmann Chiang / 17 - 7

Copyright 2001 EES

Consider a simple square domain, which is defined by the boundary

points a, d, g, and j. Assume three interior points m, n, and o have
been distributed within the domain. The Advancing Front Method
proceeds sequentially by the following steps.
1. All the edges along the initial boundary of the domain are
numerated in ccw order and saved in an array as E. Recall that
an edge is defined as a line segment between two edge nodes.
Therefore, the array E is composed of edges 1(a, b), 2 (b, c),
3 (c, d), 4(d, e),12(l, a) as shown in Figure 17-4. Edges defined
in array E will be used to construct the advancing (or generation)
front.
2. All the interior nodes are saved in an array I. Thus for the
problem shown in Figure 17-4, array I includes three points m, n,
and o.
Computational Fluid Dynamics Volume II / Hoffmann Chiang / 17 - 8
Copyright 2001 EES

10

o
k

11

5
n

e
4

12
a

Figure 17-4. Schematic of step 3 for the simply-connected

domain by the advancing front method.
Computational Fluid Dynamics Volume II / Hoffmann Chiang / 17 - 9
Copyright 2001 EES

3. Beginning with the last element in array E which represents the

last edge in the boundary, a search is conducted to locate nodes
which are on the left-hand side of the edge. This search includes
both interior nodes as well as edge nodes. These nodes will be
referred to as qualified nodes. Among the qualified nodes one
needs to select a particular node which will be referred to as the
most suitable node. Generally, the most suitable mode is one which
has the minimum norm distance to the two edge nodes among all
the qualified nodes. To illustrate this step, recall that the last edge
was defined by 12(l, a). If the most suitable node is called x, then
the criterion for its selection is rewritten as
( Lxl )2 + ( Lxa )2 = minimum, where L is the length.
Now, three nodes, l, a, and x, which are ordered in ccw fashion are
used to form a triangle. Referring to Figure 17-5, node m is selected
as the most suitable node and, subsequently, the triangle (l, a, m) is
formed.
Computational Fluid Dynamics Volume II / Hoffmann Chiang / 17 -10
Copyright 2001 EES

10

k
11
l

12

13
a

4
1

Figure 17-5. Schematic of step 4 for the simply-connected

domain by the advancing front method.
Computational Fluid Dynamics Volume II / Hoffmann Chiang / 17 -11
Copyright 2001 EES

10

g
6

k
11
11

f
5

12
a

3 d

Figure 17-6. Schematic of step 5 for the simply-connected

domain by the advancing front method.
Computational Fluid Dynamics Volume II / Hoffmann Chiang / 17 -12
Copyright 2001 EES

g
4

9
10

11

12
13

2
d

Figure 17-7. Schematic of step 6 for the simply-connected

domain by the advancing front method.
Computational Fluid Dynamics Volume II / Hoffmann Chiang / 17 -13
Copyright 2001 EES

Computational Fluid Dynamics Volume II / Hoffmann Chiang / 17 -14

Copyright 2001 EES

 Advantages
Efficiency of the scheme.
Quality of generated grid is good.
Disadvantages
riangulation of concave domains. Requires additional efforts.
1
2
3

6
5
4
Computational Fluid Dynamics Volume II / Hoffmann Chiang / 17 -15
Copyright 2001 EES

F 5
4
e

3
g
H

A
a

1 B

c
b
C2

Figure 17-13. Dirichlet tessellation and Delaunay traingulation.

Computational Fluid Dynamics Volume II / Hoffmann Chiang / 17 -16
Copyright 2001 EES

The Delaunay triangulation that corresponds to the Drichlet

tessellation is constructed by connecting generating points of all
neighboring tiles. To relate this discussion to Figure 17-13, observe
that any point inside tile A should be closer to point 8 (which is the
generating point of tile A) than to any of the points 1, 2, 3, 4, 5, 6, or
7 (which are generating points of the neighboring tiles of A).
Furthermore, note that boundary ab of tile A bisects the distance
between generating points 1 and 8 and is also perpendicular to line
1-8. Triangles are formed by connecting the generating points.

Computational Fluid Dynamics Volume II / Hoffmann Chiang / 17 -17

Copyright 2001 EES

Staggered Scheme

Staggered grid / marker and cell method

Procedure improves stability

Staggered grid can be easily generated

Pressure is specified on the primary grid, and the

velocity is specified on the secondary grid.

Computational Fluid Dynamics Volume II / Hoffmann Chiang / 17 -18

Copyright 2001 EES

vi , j + 1

v i +1, j + 1

pi,j

ui 1 , j

i-1

i1

j 1

v i +1, j 1

i3

ui + 3 , j

vi , j 1

i-2

j+ 1

pi+1,j

ui + 1 , j

j+1

i+1

i+1

j-1

i+ 3
2

i+2

Figure 8.6
Typical staggered grid and assignment of the flow variables.
Computational Fluid Dynamics Volume II / Hoffmann Chiang / 17 -19
Copyright 2001 EES

Formulation

Continuity
n+ 1
i, j

n
i, j

1
Re

(8-79)

X-momentum

un+11 un 1
i+ , j
2

un +11 un +11
v n + 1 1 un + 1 1
i , j
i, j+
i, j
i+ , j
2
2
2
+ a2 2
+
=0

x
y

i+ , j
2

n+ 1
i +1, j

n
i,j

( )

u n 1 2u n 1 + u n 3
i , j
2

i+ , j
2
2

( x )

i+ , j
2

u2

n
i + 1, j

( )

u2

x
1
Re

un 1

i+ , j1
2

n
i,j

( uv ) ni + 1 , j + 1 ( uv ) ni + 1 , j 1
2

2u n 1 + u n 1
i+ , j
2
2

( y )

i+ , j+1
2

=0

Computational Fluid Dynamics Volume II / Hoffmann Chiang / 17 -20

Copyright 2001 EES

(8-80)

Y-momentum

v n+ 1 1 v n
i , j+

1
=
Re

vn

1
i , j+
2

1
i 1 , j +
2

( uv ) ni+ 1 , j+ 1 ( uv ) ni 1 , j+ 1
2

2v n

1
i , j+
2
2

+ vn

1
i +1, j +
2

( x )

1
+
Re

vn

( )

1
i , j
2

v2

( )

v
i , j +1

n
i,j

y
2v n

1
i , j+
2
2

+ vn

i , j+

( y )

pin, j +1 pin, j

3
2

where for example

(u )

2 n
i + 1, j

(u )

2 n
i, j

1
= u 3 + u 1
i+ , j
4 i+ 2, j
2

1
= u 1 + u 1
i , j
4 i+ 2, j
2

Computational Fluid Dynamics Volume II / Hoffmann Chiang / 17 -21

Copyright 2001 EES

(8-81)