Title: Alexander Dbert
1Transformation Techniques for block structured
grids
- Alexander Döbert
- Seminar on Grid Generation
- Summer Term 2005
2Motivation
- What is a transformation ?
- Why do we need transformation techniques ?
3What is a transformation ?
Physical domain
Computational domain
4Why do we need transformation techniques I.
Problem A normal Cartesian grid with constant
parameter lines does not approximate the contour
of an object good enough.
5Why do we need transformation techniques II.
Example of an well adapted grid
6Overview
- Coordinate Transformation
- Modeling of curves and surfaces
- Distribution of points
- Generating structured grids
7Coordinate Transformation
- The basis of an object adapted grid relates to
the parameters , and . These parameter
lines continue curvilinear in the Cartesian
framework. Therefore they are called curvilinear
coordinates.
8Mapping of coordinates
computational domain
9Modeling of curves and surfaces
The boundaries of the calculation domain are
shaped as curves in 2D or surfaces in 3D. These
are generally curvilinear. The grid points inside
can be distinguished as intersections of curves
or surfaces.
10Lagrange Interpolation
- Lagrangian interpolation formula
Lagrangian polynomial
11Lagrange Interpolation
- Pro
- The polynomial itself and its derivatives are
continuous. - Contra
- In application of many points it leads to heavy
oscillations.
12Hermite Interpolation
- Hermitian interpolation formula
Hermitian polynomials
13Hermite Interpolation
- Pro
- The polynomial itself and its derivatives are
continuous. - Additionally to the discrete curve points the
gradients of these points are included. - Contra
- In application of many points it leads to heavy
oscillations.
14Spline function
Because of the oscillating character of
polynomials they are not convenient to
interpolate curves through multiple points. A
corrective is the so-called Spline
function. The interpolation polynomial is
constructed in intervals. It is demanded that the
polynomial is continuous differentiable on the
interval.
15Types of Spline functions
- Cubical spline function
- Parameter spline function
- Bézier spline function
16Cubical splines I
- Cubical spline functions are polynomials of third
order on an interval .
17Cubical splines II
- Include four constants to get enough flexibility
to ensure two continuous derivatives on the
interval boundaries.
18Parameter splines
- Both of the visualized methods are unsuitable to
generate closed curves because they require a
monotone gradient. - Parameter splines are more general and
interpolate the individual components of the
curve-coordinates each with spline functions.
19Cubical Bézier splines I
- Bézier splines apply polynomials of third order.
- They approximate the curve progression through
four so-called Bézier-Points in each interval.
20Cubical Bézier splines II
Example Four points
on the interval are given. The
progression of the curve from is
approximated as follows
With Lagrangian Polynom
21Cubical Bézier splines II
The result is the curve through
and
and the tangents at the positions
and
point to the same direction as
and
22Distribution of points
The sense of an exact description of curves and
surfaces is, that a point for an arbitrary curve
or surface parameter lies exactly on the defined
contour. The chosen points serve as boundary grid
points and therefore their distribution is very
important for the shaping of the grid.
23Distribution on curves
- Distribution of the curve Parameter in a way that
the points on the curve satisfy certain demands.
(e.g. aggregation in a part of the domain) - The relation between every point and the
appropriate curve parameter can be defined with
linear interpolation. - Determination of the distribution function
dependents on the demands.
24Distribution on curvesExample
25Distribution on surfaces I
- The determination of surface parameters is mostly
done in two steps. - First Lines in one direction
26Distribution on surfaces II
- Second Lines in the other direction
27Generating structured grids
- Shear transformation
- Tensor product transformation
- Transfinite interpolation
28Shear transformation I
- Lagrangian interpolation through two points.
- Two shearings between two boundary points
29Shear transformation II
30Tensor product transformation
- successive application of the shear
transformation. - Combines the two equations of the shear
transformation (bilinear transformation).
31Transfinite Interpolation I
- Combination of shear-transformation and
tensor-product-transformation.
32Transfinite Interpolation II
Derivation
- Sum of A and B from Shear-Transformation contains
all four boundary curves and connections lines
between adjacent vertices. - Tensor-product-transformation also generates
linear coordinate progressions. - Therefore subtract T from A B.
- The result is called Transfinite-interpolation.
33Transfinite Interpolation 3D I
- Needs three curvilinear coordinates
- This leads to
34Transfinite Interpolation 3D II
Example
35Thank you for your attention!