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-10-05 16:51:57 +05:00
|
|
|
<li><b>Wire Discretization</b> meshing algorithm - splits an edge into a
|
2015-02-25 22:07:02 +05:00
|
|
|
number of mesh segments following an 1D hypothesis.
|
|
|
|
</li>
|
2015-10-05 16:51:57 +05:00
|
|
|
<li><b>Composite Side Discretization</b> 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>
|
2016-10-03 19:53:47 +05:00
|
|
|
<li><b>Triangle: Mefisto</b> meshing algorithm - splits faces
|
2015-02-25 22:07:02 +05:00
|
|
|
into triangular elements.</li>
|
2016-10-03 19:53:47 +05:00
|
|
|
<li>\subpage quad_ijk_algo_page "Quadrangle: Mapping" meshing
|
2015-03-27 21:41:20 +05:00
|
|
|
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-10-05 16:51:57 +05:00
|
|
|
<li><b>Hexahedron (i,j,k)</b> meshing algorithm - solids are
|
2015-09-29 21:25:32 +05:00
|
|
|
split into hexahedral elements thus forming a structured 3D
|
|
|
|
mesh. The algorithm requires that 2D mesh generated on a solid could
|
2015-10-05 16:51:57 +05:00
|
|
|
be considered as a mesh of a box, i.e. there should be eight nodes
|
|
|
|
shared by three quadrangles and the rest nodes should be shared by
|
|
|
|
four quadrangles.
|
2015-09-29 21:25:32 +05:00
|
|
|
\image html hexa_ijk_mesh.png "Structured mesh generated by Hexahedron (i,j,k) on a solid bound by 16 faces"
|
|
|
|
</li>
|
|
|
|
|
2015-02-25 22:07:02 +05:00
|
|
|
<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>
|
|
|
|
|
2015-10-05 16:51:57 +05:00
|
|
|
Some 3D meshing algorithms, such as Hexahedron(i,j,k) 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>
|
2016-10-03 19:53:47 +05:00
|
|
|
<li>\subpage prism_3d_algo_page "Extrusion 3D" - for meshing prismatic 3D shapes with hexahedra and prisms.</li>
|
|
|
|
<li>\subpage quad_from_ma_algo_page "Quadrangle: Medial Axis Projection" - for quadrangle meshing of faces with sinuous borders and rings.</li>
|
2015-10-05 16:51:57 +05:00
|
|
|
<li> <b>Polygon per Face</b> meshing algorithm - generates one mesh
|
2015-06-30 17:14:46 +05:00
|
|
|
face (either a triangle, a quadrangle or a polygon) per a geometrical
|
|
|
|
face using all nodes from the face boundary.</li>
|
2016-10-03 19:53:47 +05:00
|
|
|
<li>\subpage projection_algos_page "Projection algorithms" - for meshing by projection of another mesh.</li>
|
|
|
|
<li>\subpage import_algos_page "Import algorithms" - for meshing by importing elements from another mesh.</li>
|
|
|
|
<li>\subpage radial_prism_algo_page "Radial Prism" - for meshing 3D geometrical objects with cavities with hexahedra and prisms.</li>
|
|
|
|
<li>\subpage radial_quadrangle_1D2D_algo_page "Radial Quadrangle 1D-2D" - for quadrangle meshing of disks and parts of disks.</li>
|
|
|
|
<li>\subpage use_existing_page "Use Faces/Edges to be Created Manually" - to create a 1D or a 2D mesh in a python script.</li>
|
|
|
|
<li>\subpage segments_around_vertex_algo_page "Segments around Vertex" - for defining the length of mesh segments around certain vertices.</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
|
|
|
*/
|