Department of Mechanical Engineering, Korea Advanced Institute of Science and Technology (KAIST), 291 Daehak-ro, Yuseong-gu, Daejeon 305-701, Republic of Korea
Division of Mechanical and Automotive Engineering, College of Engineering, Wonkwang University, 344-2 Sinyong-dong, Iksan-si, Jeonbuk 570-749, Republic of Korea
a r t i c l e
i n f o
Article history:
Received 17 September 2010
Received in revised form 1 September 2011
Accepted 2 September 2011
Available online 10 September 2011
Keywords:
Mesh generation
Poly-pyramid elements
Moving least square (MLS)-based nite
elements
Marching cube algorithm
a b s t r a c t
A novel scheme for three-dimensional mesh generation, termed the carving technique, is proposed with
the aid of poly-pyramid elements. Soaking the geometry information of a given model into a regular reference mesh with brick elements, the reference mesh is trimmed by the surface of the model using the
marching cube algorithm. The trimmed elements are reconstructed by the proposed elements, which
here are termed the poly-pyramid elements. Therefore, the nite element mesh is automatically generated from the surface information. Shape functions of the poly-pyramid elements are constructed by
moving least square (MLS) approximation. Numerical results are presented to examine the performance
of the poly-pyramid elements and to demonstrate the effectiveness of the proposed scheme.
2011 Elsevier B.V. All rights reserved.
1. Introduction
In the framework of nite element method (FEM), mesh generation is a necessary pre-processing for the mechanical or thermal
analysis of problem domains. Meshes with nite elements should
satisfy the connectivity condition and the compatibility condition
in order to guarantee convergence and exactness of the solution.
The meshing may not be straightforward if the problem domain
has a certain complex geometry. Although many auto-meshing
algorithms have been developed, the mesh generation is still troublesome in many cases.
In particular, it is very difcult to generate meshes with compatible hexahedral elements when modeling three-dimensional complex geometry. For this reason, generally, tetrahedral elements are
used for three-dimensional modeling. However, the hexahedral elements show better in performance than the tetrahedral elements,
due to the presence of bilinear and trilinear terms in the shape function. Therefore, the hexahedral elements are preferred for use in
FEM if possible. Many works have been conducted on the modeling
of arbitrary congurations with the hexahedral elements by way of
various approaches [14], such as mapped meshing algorithms [5,6]
including octree approaches, sweeping algorithms, and multi-block
methods; direct methods [713] including grid-based algorithm,
advancing front or plastering algorithm, and whisker weaving
algorithm; and indirect methods [1,2,14] that combine several
Corresponding author. Tel.: +82 63 850 6994; fax: +82 63 850 6691.
E-mail address: youngsamcho@wku.ac.kr (Y.-S. Cho).
0045-7825/$ - see front matter 2011 Elsevier B.V. All rights reserved.
doi:10.1016/j.cma.2011.09.002
tetrahedral elements into a hexahedral element or decompose a tetrahedral element into four hexahedral elements.
Especially, the grid-based methods [810,15] and the advancing
front methods [11,12,16] are widely known as the most successful
methods to automatically generate unstructured quadrilateral and
hexahedral meshes [17]. The grid-based methods, also called insideoutside algorithms, are based on the background grid over
the given model. These methods remove the elements located outside the model and on the model boundaries, and then t the outer
remaining mesh to the boundary geometry and topology. In contrast, the advancing front methods, also called outside-inside algorithms, start with a quadrilateral mesh formed on the model
boundaries. On the outer layer, the hexahedral elements are constructed from the quadrilateral mesh. By advancing the front of
the element layer from the boundary to the inner part, continuously, the hexahedral elements are generated over the entire
domains.
Thus far, the grid-based methods and the advancing front methods have been found to be useful with regards to the construction of
a mesh for complex domains. Nevertheless, it remains difcult to
construct appropriate meshes around complicated geometries in
an efcient manner. In the grid-based methods, as the nodes of
remaining elements are moved to the model boundaries, some elements may be severely distorted and the shape of element may not
be maintained as a hexahedron. Otherwise, in the advancing front
methods, the inner part may not be lled with the hexahedral elements, because the elements are generated from the boundary of
model, layer by layer. Therefore, the additional treatments should
209
D. Sohn et al. / Comput. Methods Appl. Mech. Engrg. 201204 (2012) 208227
uh n
NB
X
pj naj n pT nan;
j1
pT n 1; n; g; f NB 4:
NP
X
xn nI pT nan uI n2 ;
I1
@J
Mnan BnU 0;
@a
with
g1
g2
g3
1 n1
61 n
2
6
6
6 1 n3
P6
6. .
6. .
4. .
..
.
f1
f2
f3
..
.
3
7
7
7
7
7
7
7
5
0
0
2
6
2
6
6
0
0
x3 n n3
W6
6
..
..
..
6
.
.
.
4
2
0
u1
u2
0
u3 uNP
0
0
..
.
0
..
.
xNP n nNP
3
7
7
7
7
7
7
7
5
NP NP
6
7
:
UT 4 v 1 v 2 v 3 v NP 5
w1 w2 w3 wNP 3N
P
Substituting a(n) from Eq. (4) in Eq. (1), the interpolant is rewritten
as
uh n pT nM1 nBnU
NP
X
/I nuI ;
I1
where uI is the Ith column vector of UT. The shape function /I(n) can
be obtained as follows:
/I n
NB X
NB
X
pj nM1
jL BLI :
j1 L1
If the domain of inuence for the weight function dened at each nodal point is limited to the interior of the poly-pyramid element, the
shape functions by MLS approximation do not affect any elements,
210
D. Sohn et al. / Comput. Methods Appl. Mech. Engrg. 201204 (2012) 208227
except the elements including the node at which the weight function
is dened. In this case, the shape functions have the basic properties
of nite elements, such as the partition of unity, the linear completeness, and the Kronecker delta condition [2430]. Therefore, these
types of elements satisfy the compatibility condition between the
adjacent elements. These are known as MLS-based nite elements
with variable nodes [2729].
It is critical to dene the weight function in the development of
the poly-pyramid elements. The pentagonal and the hexagonal
pyramid elements in the master domain are shown in Fig. 1(a)
and (b), respectively. First, considering the weight function used
to construct the shape function of the pentagonal pyramid element, the right of Fig. 1(a) shows the cross-section of the pentagonal pyramid element on the ng-plane at a given value of f. The
weight functions of node I (I = 1, 2, . . ., 6) are dened as follows:
x1 f;
xI 1 f
3
Y
j1
Ij Ij
Ij Ij
I1;
where I A B indicates the distance between the vertex I and the
Ij Ij
edge AIj BIj which connects the vertex AIj to BIj , as shown in the right
of Fig. 1(a). The indices AIj and BIj can be expressed in a Matlab-like
denition as follows:
where the command FLOOR returns the greatest integer less than
or equal to the value in parentheses. Here, superscript denotes
the vertices on a cross-section of f = constant, intersected by the
edges connecting node 1 and nodes 26. The coordinate of I, which
is identical to that of node I when f = 0, is expressed as a function of
8
0
>
< 1 6x2 8x3 3x4 for x xxx
6 1;
1 x0
xx; x0 ; x1
0
>
:0
for x xxx
P 1:
1 x0
10
Fig. 1. Poly-pyramid elements and their cross-sections on the ngplane in the master domain: (a) a pentagonal pyramid element and (b) a hexagonal pyramid element.
D. Sohn et al. / Comput. Methods Appl. Mech. Engrg. 201204 (2012) 208227
211
Fig. 2. The weight functions for a constant f 2 [0, 1]: (a) a pentagonal pyramid element and (b) a hexagonal pyramid element.
212
D. Sohn et al. / Comput. Methods Appl. Mech. Engrg. 201204 (2012) 208227
Fig. 3. The shape functions obtained using MLS approximation with the weight function in Fig. 2: (a) a pentagonal pyramid element and (b) a hexagonal pyramid element.
Similarly, tetrahedral subdomains can be also used for the integration by partitioning the elements. However, for the tetrahedral
subdomain, it is complicated to calculate the coordinates and
weights of the integration points for higher order integration. In
contrast, the Gauss integration points of the hexahedral domain
can be easily calculated even for the higher order integration. Since
the shape functions, which are derived by the MLS approximation,
are given in the form of the rational functions inside the element,
the higher order integration is required to obtain more accurate
solution. Therefore, in this paper, the integration scheme is limited
to the integration by partitioning the element into the quadrilateral pyramid-shaped subdomains, as shown in Fig. 4.
3. Mesh generation with the aid of poly-pyramid elements
In this section, a novel scheme to generate a mesh, termed the
carving technique, is proposed with the aid of the poly-pyramid
213
D. Sohn et al. / Comput. Methods Appl. Mech. Engrg. 201204 (2012) 208227
Parental domain
Parental domain
2
4
4
6
Subdomain
7
5
Master domain
Subdomain
Master domain
y
x
Physical domain
y
x
Physical domain
Fig. 4. Numerical integration scheme by partitioning the poly-pyramid elements: (a) a pentagonal pyramid element and (b) a hexagonal pyramid element.
Fig. 5. Schematic diagram for the trimming process in the carving technique: (a) reference mesh with brick elements; (b) surface information soaked into the reference mesh;
and (c) nal conguration of the model obtained by the trimming process.
214
D. Sohn et al. / Comput. Methods Appl. Mech. Engrg. 201204 (2012) 208227
Active node
Non-active node (to be removed)
Triangulated surfaces
which may not be co-planar
Fig. 6. Eight cases of the reference brick elements to be trimmed by the surface information.
Fig. 7. Reconstruction of the trimmed brick elements with the aid of poly-pyramid elements.
215
D. Sohn et al. / Comput. Methods Appl. Mech. Engrg. 201204 (2012) 208227
Table 1
The procedure of the carving technique.
Step 1
Trimming
process
Step 2
Splitting
process
Exterior node
Outer part
Inner part
4
3
3
3
3
3
6
6
3
3
3
3
3
3
3
3
Fig. 8. The patch test for poly-pyramid elements: (a) the geometry of the model to be divided into 7 parts; (b) the composition of inner part by 12 poly-pyramid elements;
and (c) the composition of outer part by 16 poly-pyramid elements.
216
D. Sohn et al. / Comput. Methods Appl. Mech. Engrg. 201204 (2012) 208227
10-3
10
-4
10-5
10
-6
10-7
2
3
4
5
6
The order of Gauss integration for each subdomain
Fig. 9. The errors of the patch test with respect to the integration order for each
subdomain in the pentagonal and the hexagonal pyramid elements.
and the outer nodes are eliminated. The trimmed surfaces are newly formed by connecting the intersection points of the element
edge and the model surface. These may not be co-planar due to
the curvature of model surface. For this reason, the trimmed surfaces should be triangulated to represent the given geometry information. Fig. 6 shows eight cases of the trimmed brick elements. In
Fig. 6, the closed and open circles indicate the active nodes and the
non-active nodes (to be removed), respectively. If all nodes of the
element are non-active, the element is excluded from the next procedure. Otherwise, the element, which has only active nodes, remains as the brick element.
This trimming process for all regular brick elements may be
accompanied by an expensive cost. In particular, if the model is
complex, the computational cost may increase, because a large
number of reference brick elements have to be used to represent
the complex geometry of the model. Accordingly, it is worth considering a way to improve computational efciency. In this work,
only the elements located in the vicinity of the model surfaces
are stored in advance of trimming process. By doing so, the trimming process is conducted for only a fraction of the entire
elements.
In the second step, the non-conventional types of elements,
which are carved by the marching cube algorithm, are reconstructed
by adding one node in the interior of each reference element and
splitting the reference element into several pyramid elements, as
shown in Fig. 7. In this work, we have decomposed the non-conventional elements into the poly-pyramid elements. An additional node
is introduced at the inner space of the non-conventional element,
and the outer faces of the element are then connected to the additional node to construct the poly-pyramid elements. The position
of the additional node could be determined according to the rule explained in Appendix A. The trimmed surface, which is exposed to
outer space and generated by the surface of domain, may not be
co-planar, and then it should be triangulated as mentioned before.
Meanwhile, the carved surfaces, which exist at the inside of domain,
from the pre-existing hexahedral element are remained as planar
surfaces. Therefore, we could let them as triangle, quadrilateral,
pentagon, or hexagon faces. For this reason, from the triangulated
faces intersecting with the model surface, only triangular pyramid
elements are generated by connecting the triangle faces and the
additional node. Moreover, from the carved pre-existing faces, the
Fig. 10. The distribution of rmean for the meshes of a sphere, generated from: (a)
10 10 10 reference brick elements; (b) 20 20 20 reference brick elements;
and (c) 30 30 30 reference brick elements.
217
D. Sohn et al. / Comput. Methods Appl. Mech. Engrg. 201204 (2012) 208227
10
-4
10-5
10
-6
10
-7
2
3
4
5
6
The order of Gauss integration for each subdomain
10-3
From 10x10x10 reference elements
From 20x20x20 reference elements
From 30x30x30 reference elements
Through the above two steps, the surface information for the
specic model and the reference brick element are transformed
into a mesh appropriate for FEM. The entire procedure of the mesh
generation according to the present scheme is applicable to the
fully automatic algorithm, and its usage is very simple. Considering
the trimming and splitting processes for one hexahedral element,
the procedure is described in Table 1.
Recall that the poly-pyramid elements satisfy the necessary
conditions to utilize in the framework of FEM. As the domain of
inuence for the weight function is limited to the interior of the
poly-pyramid element, the partition of unity and Kronecker delta
condition are satised. Since the linear basis is used in the MLS
approximation, the linear completeness is satised inside the elements. Moreover, the linear interpolation is kept along all element
edges and on the triangle faces of the poly-pyramid elements,
respectively. Therefore, the triangle faces of the poly-pyramid elements are compatible to the triangular pyramid elements without
any gaps or overlaps. The quadrilateral face of quadrilateral pyramid element is connected to the face of another quadrilateral pyramid element or hexahedral element in a seamless way. The
compatibility condition is also kept on the pentagon face of the
pentagonal element. The reason is that the pentagonal pyramid
element, from the trimmed element by the marching cube algorithm, meets always another pentagonal pyramid element. Similarly, the hexagonal pyramid element meets another element of
the same type, and two hexagonal pyramid elements are compatible on the hexagon face. Due to these characteristics of the polypyramid elements, the framework of FE analysis does not change.
Any additional process is not required in the coupling of two
poly-pyramid elements, and of the poly-pyramid element and
the hexahedral element. That is, the procedures of calculating the
local stiffness matrices and assembling the global stiffness matrix
are the same as those of conventional FE analysis. The stiffness matrix remains symmetric and positive denite.
When the intersection point on the element edge is very close
to the active node, the elements generated by the carving technique could have poor quality. In this case, some poly-pyramid elements become relatively small and skew, and hence they lead to
ill-conditioned stiffness matrix. Therefore, we introduce a simple
way to enhance the mesh quality. This way can be optionally inserted between the trimming and the splitting processes. The procedure of the adjustment of nodal positions is explained in
Appendix B.
10-4
10
-5
10-6
2
3
4
5
6
The order of Gauss integration for each subdomain
10-5
From 10x10x10 reference elements
From 20x20x20 reference elements
From 30x30x30 reference elements
10
-7
10-8
2
3
4
5
6
The order of Gauss integration for each subdomain
Fig. 11. The errors of the sphere with respect to the integration order for each
subdomain in the pentagonal and the hexagonal pyramid elements: (a) the relative
error in displacement norm; (b) the relative error in energy norm; and (c)
maximum error norm.
218
D. Sohn et al. / Comput. Methods Appl. Mech. Engrg. 201204 (2012) 208227
v
uPnnode exact
2
u i1 u
uhi
i
t
Ed
Pnnode exact 2 ;
ui
i1
v
uR
u eexact eh T Ceexact eh dX
;
Ee t X R
exact T Ceexact dX
X e
Em max uexact
uhi ;
i
16i6nnode
11
12
13
Fig. 12. The shape of femur and the boundary conditions imposed on top and bottom sides.
D. Sohn et al. / Comput. Methods Appl. Mech. Engrg. 201204 (2012) 208227
219
Fig. 13. The meshes of the femur and the contours of von Mises stress obtained by: (a) the carving technique and (b) the use of Hypermesh and Abaqus.
model the sphere, whose radius r is 1 m. Soaking the surface information into the reference brick elements, the mesh for FEM is
220
D. Sohn et al. / Comput. Methods Appl. Mech. Engrg. 201204 (2012) 208227
Fig. 14. The contours of von Mises stress on the cross-section of the femur at z = 158.66 mm obtained by: (a) the carving technique with the poly-pyramid elements and (b)
the use of Hypermesh and Abaqus with the tetrahedral elements.
126
The carving technique
Hypermesh & Abaqus
Reference solution
125
Total strain energy (mJ)
moves to origin of the sphere, i.e., they are prescribed in the form
of dr = (u2 + v2 + w2)1/2 = 0.01 m, where u, v, and w indicate the displacements in the x-, y-, and z-directions, respectively. The material properties are given as E = 1.0 106 Pa and m = 0.3.
In this example, the meshes are generated from 10 10 10,
20 20 20, and 30 30 30 reference elements. Fig. 10 displays the mean stresses dened as rmean = (rxx + ryy + rzz)/3 for
these three models, using the sixth-order integration for each subdomain of the pentagonal and the hexagonal pyramid elements.
The mean stress of the exact solution is 25,000 Pa, which is uniformly distributed throughout the entire domain. It can be seen
from Fig. 10 that the results by the proposed scheme are very similar to the exact values. Furthermore, the relative errors and maximum error were calculated according to Eqs. (11)(13) to examine
the accuracy in a strict sense. Fig. 11(a) and (b) display the relative
error in the displacement norm and energy norm versus the integration order in each subdomain. The maximum error norm is also
plotted in Fig. 11(c) with respect to the integration order. These gures show that the errors decrease in the case of higher order integration, consistent with the tendency in the rst example.
124
123
122
10000
20000
30000
40000
The number of nodes
50000
60000
Fig. 15. The total strain energy of the femur versus the number of nodes.
Table 2
The time spent on the modeling and analysis of the femur.
Scheme
The number of
nodes
The number of
elements
Analysis
The carving
technique
6,101
12,752
22,917
55,612
13,421
26,202
44,472
98,254
0.437
0.828
1.500
4.453
10.766
24.719
45.844
128.781
Hypermesh and
Abaqus
6,683
12,809
22,860
56,047
32,486
64,923
119,249
302,921
1.203
2.013
3.370
8.507
7
14
27
95
D. Sohn et al. / Comput. Methods Appl. Mech. Engrg. 201204 (2012) 208227
221
Fig. 16. The model description of a cube with voids: (a) the random distribution of various sized voids and (b) the geometry and boundary conditions.
222
D. Sohn et al. / Comput. Methods Appl. Mech. Engrg. 201204 (2012) 208227
Fig. 17. The distributions of von Mises stress in the cube with voids obtained by: (a) the carving technique; (b) the use of Hypermesh and Abaqus with linear tetrahedral
elements; and (c) the use of Hypermesh and Abaqus with quadratic tetrahedral elements.
(3.2 GHz), the time for mesh generation and analysis was measured as shown in Table 2. When the models are constructed with
the similar number of nodes, it is observed from Table 2 that the
carving technique is cheaper than Hypermesh in the aspect of computational cost of modeling. In the case of analysis, Abaqus provides better performance than the carving technique, because
Abaqus is the commercial tool which adopts the advanced techniques to reduce the computational time. It is noteworthy that
the carving technique gives the accurate solutions with low cost
of modeling.
4.4. Cube with the randomly distributed voids
A cube including sphere-shaped voids, illustrated in Fig. 16(a),
is chosen as an example of the model with inner trimmed surfaces.
Inside the 100 mm 100 mm 100 mm cube, total 30 voids are
223
D. Sohn et al. / Comput. Methods Appl. Mech. Engrg. 201204 (2012) 208227
23.2
23.0
Total strain energy (J)
22.8
22.6
22.4
22.2
22.0
10000
20000
70000
Fig. 18. The total strain energy of the cube with voids versus the number of nodes.
Table 3
The time spent on the modeling and analysis of the cube with the randomly
distributed voids.
Scheme
The number of
nodes
The number of
elements
Analysis
The carving
technique
11,213
31,961
69,134
19,734
50,698
102,210
0.453
1.641
4.484
38.579
92.203
216.782
Hypermesh and
Abaqus
10,028
38,528
72,235
48,796
200,804
385,286
1.830
6.293
11.833
11
74
187
224
D. Sohn et al. / Comput. Methods Appl. Mech. Engrg. 201204 (2012) 208227
(a)
u=v=w=0
P = 10 MPa
20 mm
y
100 mm
z
(b)
20 mm
y
z
y
z
A pentagonal
pyramid element
Triangular
pyramid
elements
A hexagonal
pyramid element
(c)
y
z
x
Triangular pyramid elements over the entire domain
Fig. 19. A cantilever beam under transverse loading condition: (a) the geometry and boundary conditions for the reference brick elements; (b) the mesh generated by the
carving technique and its variation; and (c) the mesh with tetrahedral elements over the entire domain.
ments into the tetrahedral elements. In the same manner, for the
cube with the randomly distributed voids, the meshes are reconstructed from those in Fig. 17(a) without the pentagonal and the
hexagonal pyramid elements. Fig. 21(a) and (b) show the values
of the total strain energy from the variation of the carving technique with the results in Sections 4.3 and 4.4. It can be seen that
the carving technique provides slightly better results, closer to
the reference solution, than its variation.
From the above results in this section, we can deduce as follows: In the framework of the carving technique, the pentagonal
and the hexagonal pyramid elements do not signicantly affect
the results in the simple problems such as the cantilever beam.
However, in more practical problems, these elements play a role
to enhance the accuracy of solutions. Besides, when various types
of the poly-pyramid elements are directly used in the splitting process, we can reduce an additional cost to decompose them into the
tetrahedral elements. Therefore, it is worthwhile to apply the pen-
225
D. Sohn et al. / Comput. Methods Appl. Mech. Engrg. 201204 (2012) 208227
0.485
126
The carving technique
The variation of the carving technique
Hypermesh & Abaqus
Reference solution
125
Total strain energy (mJ)
0.480
0.475
124
123
0.470
122
0
10000
20000
30000
40000
The number of nodes
50000
970
10000
23.2
20000
30000
40000
The number of nodes
50000
60000
965
23.0
Total strain energy (J)
960
955
950
945
The carving technique
The variation of the carving technique
Hexahedral elements
Tetrahedral elements
940
22.8
22.6
22.4
22.2
22.0
935
0
10000
20000
30000
40000
The number of nodes
10000
50000
20000
70000
Fig. 20. The tendency of convergence according to the elements used in the
cantilever beam problem, in terms of: (a) tip deections and (b) the total strain
energy.
Fig. 21. The tendency of convergence in terms of the total strain energy, according
to the elements used in: (a) the example in Section 4.3 and (b) the example in
Section 4.4.
Acknowledgements
5. Conclusion
In this paper, a novel meshing scheme, termed the carving technique, is proposed. The scheme is based on the marching cube
algorithm in combination with the poly-pyramid elements by
MLS approximation. The carving technique simplies the mesh
generation procedure. In particular, a strong advantage is gained
when it is applied to structures with a complicated geometry. Furthermore, the entire process, from modeling to analysis, can be
implemented automatically.
Through several numerical examples, the performance of the
poly-pyramid elements developed in this paper was veried and
efcient applications of the carving techniques were shown. The
proposed scheme is expected to be useful for various applications,
such as three-dimensional crack propagation, physics-based computer graphics, and others. Future work may include the proposed
scheme applied to more complex problems.
xa
N el
1 X
xI ;
Nel I1
A:1
226
D. Sohn et al. / Comput. Methods Appl. Mech. Engrg. 201204 (2012) 208227
b
Pentagonal
pyramid element
Triangular
pyramid element
Shifting the active nodes
to the intersection points
Pentagonal
pyramid element
Pentagonal
pyramid element
Active node
Intersection point
Additional node in an element
Quadrilateral
pyramid element
Quadrilateral
pyramid element
Fig. B.1. Adjustment of nodal positions to improve the mesh quality: (a) the trimmed elements with the intersection points close to the active node and (b) shifting the active
nodes to the intersection point.
[2] J.F. Shepherd, C.R. Johnson, Hexahedral mesh generation constraints, Engrg.
Comput. 24 (2008) 195213.
[3] T.J. Tautges, The generation of hexahedral meshes for assembly geometry:
survey and progress, Int. J. Numer. Methods Engrg. 50 (2001) 2617
2642.
[4] M.L. Staten, J.F. Shepherd, F. Ledoux, K. Shimada, Hexahedral mesh matching:
converting non-conforming hexahedral-to-hexahedral interfaces into
conforming interfaces, Int. J. Numer. Methods Engrg. 82 (2010) 14751509.
[5] W.A. Cook, W.R. Oakes, Mapping methods for generating three-dimensional
meshes, Comput. Mech. Engrg. 1 (1982) 6772.
[6] M.L. Staten, S.A. Canann, S.J. Owen, BMSweep: locating interior nodes during
sweeping, Engrg. Comput. 15 (1999) 212218.
[7] Y. Ito, A.M. Shih, B.K. Soni, Octree-based reasonable-quality hexahedral mesh
generation using a new set of renement templates, Int. J. Numer. Methods
Engrg. 77 (2009) 18091833.
[8] J. Qian, Y. Zhang, W. Wang, A.C. Lewis, M.A.S. Qidwai, A.B. Geltmacher, Quality
improvement of non-manifold hexahedral meshes for critical feature
determination of microstructure materials, Int. J. Numer. Methods Engrg. 82
(2010) 14061423.
[9] H. Zhang, G. Zhao, Adaptive hexahedral mesh generation based on local
domain curvature and thickness using a modied grid-based method, Finite
Elem. Anal. Des. 43 (2007) 691704.
[10] Y. Zhang, T.J.R. Hughes, C.L. Bajaj, An automatic 3D mesh generation method
for domains with multiple materials, Comput. Methods Appl. Mech. Engrg. 199
(2010) 405415.
[11] T.D. Blacker, R.J. Meyers, Seams and wedges in plastering: a 3-D hexahedral
mesh generation algorithm, Engrg. Comput. 9 (1993) 8393.
[12] M.L. Staten, R.A. Kerr, S.J. Owen, T.D. Blacker, M. Stupazzini, K. Shimada,
Unconstrained plastering-hexahedral mesh generation via advancing-front
geometry decomposition, Int. J. Numer. Methods Engrg. 81 (2009) 135
171.
[13] N.T. Folwell, S.A. Mitchell, Reliable whisker weaving via curve contraction,
Engrg. Comput. 15 (1999) 292302.
[14] T. Taniguchi, T. Goda, H. Kasper, W. Zielke, Hexahedral mesh generation of
complex composite domain, in: Fifth International Conference on Grid
Generation in Computational Field Simulations, 1996, pp. 699707.
[15] X. Liang, M.S. Ebeida, Y. Zhang, Guaranteed-quality all-quadrilateral mesh
generation with feature preservation, Comput. Methods Appl. Mech. Engrg.
199 (2010) 20722083.
[16] J.Z. Zhu, O.C. Zienkiewicz, E. Hinton, J. Wu, A new approach to the development
of automatic quadrilateral mesh generation, Int. J. Numer. Methods Engrg. 32
(1991) 849866.
[17] X. Roca, E. Ruiz-Girones, J. Sarrate, Receding front method: a new approach
applied to generate hexahedral meshes of outer domains, in: Proceedings of
the 19th International Meshing Roundtable, 2010, pp. 209225.
[18] W.E. Lorensen, H.E. Cline, Marching cubes: a high resolution 3D surface
construction algorithm, ACM SIGGRAPH Comput. Graph. 21 (1987) 163169.
[19] T.S. Newman, H. Yi, A survey of the marching cubes algorithm, Comput. Graph.
30 (2006) 854879.
[20] Z.L. Wang, J.C.M. Teo, C.K. Chui, S.H. Ong, C.H. Yan, S.C. Wang, H.K. Wong, S.H.
Teoh, Computational biomechanical modelling of the lumbar spine using
marching-cubes surface smoothened nite element voxel meshing, Comput.
Methods Prog. Biomed. 80 (2005) 2535.
[21] S. Li, W.K. Liu, Meshfree Particle Methods, Springer, New York, 2004.
[22] H.-G. Kim, Interface element method (IEM) for a partitioned system with nonmatching interfaces, Comput. Methods Appl. Mech. Engrg. 191 (2002) 3165
3194.
D. Sohn et al. / Comput. Methods Appl. Mech. Engrg. 201204 (2012) 208227
[23] H.-G. Kim, Development of three-dimensional interface elements for coupling
of non-matching hexahedral meshes, Comput. Methods Appl. Mech. Engrg.
197 (2008) 38703882.
[24] Y.-S. Cho, S. Jun, S. Im, H.-G. Kim, An improved interface element with variable
nodes for non-matching nite element meshes, Comput. Methods Appl. Mech.
Engrg. 194 (2005) 30223046.
[25] Y.-S. Cho, S. Im, MLS-based variable-node elements compatible with quadratic
interpolation. Part I: Formulation and application for non-matching meshes,
Int. J. Numer. Methods Engrg. 65 (2006) 494516.
[26] Y.-S. Cho, S. Im, MLS-based variable-node elements compatible with quadratic
interpolation. Part II: Application for nite crack element, Int. J. Numer.
Methods Engrg. 65 (2006) 517547.
[27] J.H. Lim, S. Im, Y.-S. Cho, MLS (moving least square)-based nite elements for
three-dimensional nonmatching meshes and adaptive mesh renement,
Comput. Methods Appl. Mech. Engrg. 196 (2007) 22162228.
227
[28] J.H. Lim, S. Im, Y.-S. Cho, Variable-node elements for non-matching meshes by
means of MLS (moving least-square) scheme, Int. J. Numer. Methods Engrg. 72
(2007) 835857.
[29] J.H. Lim, D. Sohn, J.H. Lee, S. Im, Variable-node nite elements with smoothed
integration techniques and their applications for multiscale mechanics
problems, Comput. Struct. 88 (2010) 413425.
[30] J.-S. Chen, C.-T. Wu, S. Yoon, Y. You, A stabilized conforming nodal integration
for Galerkin mesh-free methods, Int. J. Numer. Methods Engrg. 50 (2001) 435
466.
[31] G.R. Liu, K.Y. Dai, T.T. Nguyen, A smoothed nite element for mechanics
problems, Comput. Mech. 39 (2007) 859877.
[32] S.E. Mousavi, H. Xiao, N. Sukumar, Generalized Gaussian quadrature rules on
arbitrary polygons, Int. J. Numer. Methods Engrg. 82 (2010) 99113.
[33] A. Tabrraei, N. Sukumar, Application of polygonal nite elements in linear
elasticity, Int. J. Comput. Methods 3 (2006) 503520.