2008-03-07 12:47:05 +05:00
|
|
|
/*!
|
|
|
|
|
|
|
|
\page basic_meshing_algos_page Basic meshing algorithms
|
|
|
|
|
|
|
|
\n The MESH module contains a set of meshing algorithms, which are
|
2015-02-25 22:07:02 +05:00
|
|
|
used for meshing entities (1D, 2D, 3D sub-shapes) composing
|
|
|
|
geometrical objects.
|
|
|
|
|
|
|
|
An algorithm represents either an implementation of a certain meshing
|
2015-05-25 14:40:41 +05:00
|
|
|
technique or an interface to the whole meshing program generating elements
|
2015-02-25 22:07:02 +05:00
|
|
|
of several dimensions.
|
2008-03-07 12:47:05 +05:00
|
|
|
|
|
|
|
<ul>
|
|
|
|
<li>For meshing of 1D entities (<b>edges</b>):</li>
|
2015-02-25 22:07:02 +05:00
|
|
|
\anchor a1d_algos_anchor
|
2008-03-07 12:47:05 +05:00
|
|
|
<ul>
|
2015-02-25 22:07:02 +05:00
|
|
|
<li><em>Wire Discretization</em> meshing algorithm - splits an edge into a
|
|
|
|
number of mesh segments following an 1D hypothesis.
|
|
|
|
</li>
|
2015-05-25 14:40:41 +05:00
|
|
|
<li><em>Composite Side Discretization</em> algorithm - allows to apply a 1D
|
2015-02-25 22:07:02 +05:00
|
|
|
hypothesis to a whole side of a geometrical face even if it is
|
2015-05-25 14:40:41 +05:00
|
|
|
composed of several edges provided that they form C1 curve in all
|
|
|
|
faces of the main shape.</li>
|
2008-03-07 12:47:05 +05:00
|
|
|
</ul>
|
|
|
|
|
|
|
|
<li>For meshing of 2D entities (<b>faces</b>):</li>
|
|
|
|
|
|
|
|
<ul>
|
2015-02-25 22:07:02 +05:00
|
|
|
<li><em>Triangle (Mefisto)</em> meshing algorithm - splits faces
|
|
|
|
into triangular elements.</li>
|
2015-03-27 21:41:20 +05:00
|
|
|
<li>\subpage quad_ijk_algo_page "Quadrangle (Mapping)" meshing
|
|
|
|
algorithm - splits faces into quadrangular elements.</li>
|
2008-03-07 12:47:05 +05:00
|
|
|
</ul>
|
|
|
|
|
2009-02-17 10:27:49 +05:00
|
|
|
\image html image123.gif "Example of a triangular 2D mesh"
|
2008-03-07 12:47:05 +05:00
|
|
|
|
2009-02-17 10:27:49 +05:00
|
|
|
\image html image124.gif "Example of a quadrangular 2D mesh"
|
2008-03-07 12:47:05 +05:00
|
|
|
|
2013-05-29 19:36:40 +06:00
|
|
|
<li>For meshing of 3D entities (<b>solid objects</b>):</li>
|
2008-03-07 12:47:05 +05:00
|
|
|
|
|
|
|
<ul>
|
2015-02-25 22:07:02 +05:00
|
|
|
<li><em>Hexahedron (i,j,k)</em>meshing algorithm - 6-sided solids are
|
|
|
|
split into hexahedral (cuboid) elements.</li>
|
|
|
|
<li>\subpage cartesian_algo_page "Body Fitting" meshing
|
|
|
|
algorithm - solids are split into hexahedral elements forming
|
|
|
|
a Cartesian grid; polyhedra and other types of elements are generated
|
|
|
|
where the geometrical boundary intersects Cartesian cells.</li>
|
2008-03-07 12:47:05 +05:00
|
|
|
</ul>
|
|
|
|
|
2009-02-17 10:27:49 +05:00
|
|
|
\image html image125.gif "Example of a tetrahedral 3D mesh"
|
2008-03-07 12:47:05 +05:00
|
|
|
|
2009-02-17 10:27:49 +05:00
|
|
|
\image html image126.gif "Example of a hexahedral 3D mesh"
|
2008-03-07 12:47:05 +05:00
|
|
|
</ul>
|
|
|
|
|
2013-04-18 13:58:41 +06:00
|
|
|
Some 3D meshing algorithms, such as Hexahedron(i,j,k) and some
|
2015-02-25 22:07:02 +05:00
|
|
|
commercial ones, also can generate 3D meshes from 2D meshes, working
|
|
|
|
without geometrical objects.
|
2009-02-17 10:27:49 +05:00
|
|
|
|
|
|
|
There is also a number of more specific algorithms:
|
2008-03-07 12:47:05 +05:00
|
|
|
<ul>
|
2014-11-07 18:51:28 +05:00
|
|
|
<li>\subpage prism_3d_algo_page "for meshing prismatic shapes"</li>
|
2009-02-17 10:27:49 +05:00
|
|
|
<li>\subpage projection_algos_page "for meshing by projection of another mesh"</li>
|
2012-08-09 16:03:55 +06:00
|
|
|
<li>\subpage import_algos_page "for meshing by importing elements from another mesh"</li>
|
2009-02-17 10:27:49 +05:00
|
|
|
<li>\subpage radial_prism_algo_page "for meshing geometrical objects with cavities"</li>
|
2012-08-09 16:03:55 +06:00
|
|
|
<li>\subpage radial_quadrangle_1D2D_algo_page "for meshing special 2d faces (circles and part of circles)"</li>
|
2014-05-05 11:25:50 +06:00
|
|
|
<li>\subpage use_existing_page "Use Edges to be Created Manually" and
|
|
|
|
\ref use_existing_page "Use Faces to be Created Manually" algorithms can be
|
|
|
|
used to create a 1D or a 2D mesh in a python script.</li>
|
2014-11-07 18:51:28 +05:00
|
|
|
<li>\subpage segments_around_vertex_algo_page "for defining the local size of elements around a certain node"</li>
|
2008-03-07 12:47:05 +05:00
|
|
|
</ul>
|
|
|
|
|
|
|
|
\ref constructing_meshes_page "Constructing meshes" page describes in
|
|
|
|
detail how to apply meshing algorithms.
|
|
|
|
|
|
|
|
<br><b>See Also</b> a sample TUI Script of a
|
|
|
|
\ref tui_defining_meshing_algos "Define Meshing Algorithm" operation.
|
|
|
|
|
2012-08-09 16:03:55 +06:00
|
|
|
*/
|