Professional Documents
Culture Documents
Abstract.
Extensive studies have been conducted on the generation of unstructured meshes of triangles for
the purpose of nite element analysis. Delaunay triangulation has been the basis of several such
methods, and has lead to algorithms that can produce unstructured meshes of triangles for any planar
domain. However, there have not been many robust methods for producing unstructured meshes of
quadrilaterals. This is unfortunate, because for plain stress and plain strain problems solved using
nite element analysis, 4-noded quadrilateral elements perform much better than 3-noded triangular
elements, especially when the discretisation is not dense.
In this paper, we present an extremely simple and guaranteed method to generate meshes of quadri-
laterals from meshes of triangles generated using a robust Delaunay triangulation algorithm. The
elements thus obtained have less than optimal aspect ratios. In order to determine if the less than
optimal aspect ratios of the elements aect the quality of results when these meshes are used for
nite element modeling, we applied these meshes to the solution of a problem. We are of the opinion
that a mesh of quadrilaterals generated in the inexpensive manner presented in this paper produces
results that compare well even with those from mapped meshes. Thus, the presented method provides
an ecient, simple and eective way to generate unstructured meshes of quadrilaterals of reasonable
quality.
Keywords. Delaunay unstructured quadrilateral triangular mesh nite element mapped
1 Background
In the past, a number of algorithms for generation of unstructured triangular meshes have been reported
[Chew 89, Cavendish 83, Ruppert 92] (Structured or mapped meshes are developed through mappings of a
mesh dened in a logical domain into a geometric domain, whereas unstructured meshes do not depend upon
a topologically similar logical domain. However, it has been the analysts' experience that in nite element
analyses, for a given number of degrees of freedom (DOF), 4-noded quadrilateral elements provide better
results than 3-noded triangular elements [Cook et al 74]. The 3-noded constant strain triangle behaves
poorly in bending because the stresses and strains are constant within the element. However, the results
improve when the mesh becomes ner [Cook et al 74].
There have been attempts to come up with algorithms yielding good-quality meshes of quadrilaterals. The
Paving algorithm is one of them [Blacker 90]. There are a number of algorithms that produce mapped
(structured) meshes of quadrilaterals. However, a disadvantage of mapped meshes is that they cannot
be adapted to t any region. There have been quite a few algorithms to improve the quality of meshes
Graduate student, Dept. of Civil Engineering, University of New Mexico
y Associate Professor, Dept. of Civil Engineering, University of New Mexico
Triangle Three Quadrilaterals
of triangles too, and sometimes these approaches talk about using meshes of quadrilaterals in place of
triangles[Cannan 96, Mavriplis 97].
P = 1 lb
1"
l = 70"
3 Analytical Solution
The analytical solution for the vertical displacement at the top of the free end of a cantilever beam loaded
at the free end is made up of two parts:
12 (1)
= 1 1210 = 10
3 3
12
The vertical displacement at the free end due to bending is given by:
b = 3EI Pl3 (2)
where E is the Young's Modulus of elasticity of the material of the beam. Thus,
b = 1 703
3 29000 10123
b = 4:731 10?2 in
3.2 Vertical Displacement Due to Shear
According to Equation. 6.52 in [Wempner 95], the de
ection of a beam due to shear is given by the formula
ds = V (x)Q0 (3)
dx GIt
s - vertical displacement due to shear
V (x) - shear at point x
where GQ0 - moment of the cross-sectional area about its centroid
- shear modulus
I - moment of inertia of the cross-section
t - thickness of the cross-section
Using the values calculated from the problem data, subject to the boundary condition that s = 0 at the
xed end (x = 0), it is determined that
ds = 1:3448 10?5 (4)
dx
s = 1:3448 10?5x (5)
Then, x = 70 gives s = 0:0941 10?2 in:
6 Conclusions
The unstructured meshes performed satisfactorily when the meshes were dense. The Delaunay meshes of
quadrilaterals gave results comparable to the ones obtained using structured meshes at almost all mesh
densities. However, it was noted that in order to reach the same accuracy as a structured mesh, the
Delaunay meshes required a higher number of DOF, although the dierence in error at any stage was only
a few percent. In the case of the 3-noded triangles, it was noted that the Delaunay meshes seem to perform
better than the mapped meshes.
In the comparisons given above, the generation time also has been included in the `cost' of a mesh. Comparing
between triangular and quadrilateral Delaunay meshes, it was found that the quadrilateral meshes performed
better than triangular meshes at smaller numbers of DOF. At higher numbers of DOF, the dierence in results
became small. However, it has to be remembered that the eort involved in generating a Delaunay mesh of
quadrilaterals of a certain neness is much less than the eort required in generating a Delaunay mesh or
triangles of similar neness.
It is concluded that meshes of quadrilaterals generated from a Delaunay mesh of triangles do compare
well even with mapped meshes. The creation of meshes of quadrilaterals from meshes of triangles may be
employed when one wishes to make use of quadrilateral elements but does not wish to create a mesh of
quadrilaterals from start or the region to be meshed is complicated and generation of a structured mesh is
dicult. This is an advantage that the Delaunay meshes of quadrilaterals have over structured meshes of
quadrilaterals.
It is hoped that from this study one can get insights into how the meshes of triangular and quadrilateral
elements behave, and at which stage should one opt for a mesh of quadrilaterals created either using a
specialized algorithm or use a structured mesh if possible. The authors feel that the mesh of quadrilaterals
created from a mesh of triangles in the inexpensive manner mentioned above gives good results, and the
method may be adopted whenever one wishes to make use of the ecient triangular mesh generators and
take advantage of the quadrilateral elements' better performance in nite element analyses.
In the study conducted, only one test problem has been considered. Alhough the problem we chose is a
simple one but brings out the problems with 3-noded triangular elements, other problems could conceivably
show dierent results.
vertical displacement at the top of free end
against the number of degrees of freedom
8 9
0.050 10
11
22
6 21 7
14 5 18 15
vertical displacement (in) 20
4
17
19 13
0.040
16
3 12
0.030
3-Noded Triangular Elements, Gauss Order 1 (Delaunay)
4-Noded Quadrilateral Elements, Gauss Order 1 (Delaunay)
4-Noded Quadrilateral Elements, Gauss Order 2 (Delaunay)
3-Noded Triangular Elements, Gauss Order 1 (Mapped)
0.020 4-Noded Quadrilateral Elements, Gauss Order 2 (Mapped)
exact
2
1
0.010
0.0 1000.0 2000.0 3000.0
number of DOF
9
8
10
11
0.0 21
22
5 6 15 7
20 14
18
4
17
19 13
percentage error
-20.0
16
3 12
-40.0
3-Noded Triangular Elements, Gauss Order 1 (Delaunay)
4-Noded Quadrilateral Elements, Gauss Order 1 (Delaunay)
4-Noded Quadrilateral Elements, Gauss Order 2 (Delaunay)
3-Noded Triangular Elements, Gauss Order 1 (Mapped)
-60.0 4-Noded Quadrilateral Elements, Gauss Order 2 (Mapped)
2 exact
1
-80.0
0.0 1000.0 2000.0 3000.0
number of DOF
References
[Atencio et al 97] Atencio, Lance., Gerstle, Walter H., Panthaki, Malcolm J., Sahu, Raikanta. Object-
Oriented Design and Development of a Computational Mechanics Toolkit, pp 73-79,
Proceedings, URC-TC 1997.
[Bathe 96] Bathe, Klaus-Jurgen., (1996), Finite Element Procedures. Englewood Clis, NJ:
Prentice-Hall.
[Bern 90] Bern, Marshall., Eppstein, David., Gilbert, David., Provably Good Mesh Generation,
1990 Symposium on Foundations of Computer Science.
[Blacker 90] Blacker, Ted D., Stephenson, Michael B. (1990) Paving: A New Approach to Auto-
mated Quadrilateral Mesh Generation, Sandia Report # SAND90-0249. UC-705.
[Cannan 96] Cannan, S.A., Muthukrishnan, S.N., Phillips, R.K., Topological Renement Proce-
dures for Triangular Finite Element Meshes, Engineering With Computers, v.12(#3-
4), pp. 243-255 1996 .
[Cavendish 83] Cavendish, James C., Frey, WilliamH. (1983) Fast Planar Mesh Generation Using the
Delaunay Triangulation, Research Publication GWR-4555, General Motors Research
Laboratories, Warren, MI.
[Chew 89] Chew, L. Paul, Guaranteed-Quality Triangular Meshes, (1989) Publication No: TR-
89-983, Department of Computer Science, Cornell University, Ithaca, NY.
[Cook et al 74] Cook, Robert D., Malkus, David S., Plesha, Michael E., (1974) Concepts and Appli-
cations of Finite Element Analysis, Edn. 3, New York: John Wiley & Sons.
[Mavriplis 97] Mavriplis, D.J., Unstructured Grid Techniques, Annual Review of Fluid Mechanics,
v. 29, pp. 473-514, 1997.
[Ruppert 92] Ruppert, Jim. (1992) A New and Simple Algorithm for Quality 2-Dimensional Mesh
Generation, Report No: UCB/CSD 92/694, University of California, Berkeley, CA.
[Wempner 95] Wempner, Gerald. (1995) Mechanics of Solids, Section 6.6, De
ection Due to Shear,
Boston, MA: PWS Publishing Company.