P. 1
Modern Introduction to Grid-Generation

Modern Introduction to Grid-Generation

|Views: 359|Likes:
Published by mbarkazohir

More info:

Published by: mbarkazohir on May 10, 2011
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less





In this section we perform the simple task of generating a monoblock grid for a rectangle. How-
ever, this simple example allows us to introduce most of the concepts needed for advanced grid
generation. In Sec. we generate a 6 block grid for a diamond shaped body. In order to
generate a grid two types of informa tion have to be provided, namely the block connectivity
information and the grid point distribution on the physical boundary of the solution domain (SD).

First the so called control Þle or command Þle (extenion .cmd) has to be speciÞed. The com-
mand Þle describes the blocking of the solution domain. It also contains the references to those
Þles that contain the surface grid. Since this is the Þrst example, a 2D problem is considered only.
Therefore, the surface grid simply consists of the grid point distribution on the four edges (sides) of
the rectangle. The grid point distribution can be generated interactively, using the tools (see Chap-
ter Grid Generation Tools) Poli and Spline2D. In this example it is assumed that the command
(connectivity) information is stored in the Þle rect.cmd and the geometry data (edge description)
is stored in rect.lin. The Þrst line of the command Þle contains the keyword cntrl2D that simply
denotes a 2D SD. The 1 in next line denotes the block number, followed by the dimensions of
the block (ξ

η directions)11 10. It should be noted that two different coordinate systems are used.
In Physical Space (also denoted as the Physical Plane) coordinates are described by (x y

z). For

complex geometries, curvilinear coordinates (ξ


ζ) are needed whose directions are conforming
to the shape of the conÞguration. The elliptic grid generation equations as well as the ßow equa-
tions are solved in the transformed or Computational Space (Plane) (see Sec ...). In this plane
coordinate directions are denoted by I, J, and K. In Grid

the following rule applies (respectively

in three dimensions):

Rule: In specifying the dimensions of a block the Þrst number denotes the number of grid
points in the
ξ´ Iµ

direction (number of columns), the second one gives the number of points

in the η´ Jµ

direction (number of rows).

A second input rule determines the orientation of the edges with respect to the axes of the
coordinate system. If a grid comprises several blocks, each block can have its own local coordinate
system and these systems can be rotated with respect to each other. In 2Dthe rotation isdetermined
automatically by the code. The four edges of a block are numbered 1, 2, 3, and 4. However, to
enable the code to perform the automatic detection of rotated blocks, the following rule must be
obeyed (for three dimensions see later chapter):

Rule: With respect to the coordinate axes of the block the numbering of the edges has to be
such that: edge 1 is east, edge 2 is north, edge 3 is west, and edge 4 points south.

In what follows, a description of the simple format of the command Þle is given, sufÞcient for
the rectangle example. The complete command Þle format is described in section ??. The next
four lines describe the edges of the rectangle.

The Þrst integer gives the number of the edge, followed by the type of the side. A type 0
or 1 describes a Þxed boundary, a type 2 or 3 indicates a matching boundary, i.e. an interblock
boundary. In this example, there are only Þxed edges, hence sides are either of type 0 or 1. A side
of type 1 is used for interpolating an initial grid. For each point on this edge the corresponding

Numerical Grid Generation


point on the opposite edge is known. If this edge is of type matching, the corresponding opposite
side in the neighboring block is investigated. If this edge is Þxed, a linear interpolation between
the two corresponding Þxed edges is performed. If the edge is matching, the algorithm continues
through all blocks until a Þxed side is encountered. Since the interpolation is linear, the quality
of the initial grid depends on the choice of the edge where the interpolation process starts from.
To obtain a good initial grid, several edges can be used. Moreover, an interpolated grid may be
partly overwritten in this process, allowing complete freedom. The interpolated grid speeds up the
grid generation process by a factor of 5 - 10, making it possible to generate grids with hundreds
of thousands of points on a workstation. The next two integers are needed to describe the block
connectivity, specifying the block and edge number of the neighboring block. If an edge is not
neighbored, these numbers are 0. Integers 5 and 6 describe the so called control functions (see next
Chapter) used for grid point clustering. The last line, Þle rect.lin is a reference to the geometry Þle
that contains the coordinate values of the 4 edges of the rectangle in exactly the same order as the
edges occur in the command Þle. For example, it would have been possible to describe edge 2 Þrst
and the edge 1 in the command Þle. In that case, however, the sequence of the edge coordinates in
Þle Þle rect.lin must be consistent with the order of the edges in Þle rect.cmd.



11 10
1 1 0 0 0 0
2 0 0 0 0 0
3 0 0 0 0 0
4 0 0 0 0 0

Þle rect.lin

In Þle Þle rect.lin the Þrst line indicates that data are of type line 2d, that is are part of a
2D curve. The next value gives the number of coordinate pairs (x, y) that form this line. It should
be noted that all physiacl coordinates are given with respect to a Cartesian coordinate system that
holds for all blocks.

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->