X-Git-Url: http://git.salome-platform.org/gitweb/?p=modules%2Fsmesh.git;a=blobdiff_plain;f=doc%2Fsalome%2Fgui%2FSMESH%2Finput%2Fbasic_meshing_algos.doc;h=080727462dc2113a6b5a95b6cab6f0b67a91641b;hp=a4ebe1c8a0765b9082683f0dbc38e11c3615cd38;hb=193c49c87753b6ccabb2b5e6dc935aa480d2d43e;hpb=bd4e115a78b52e3fbc016e5e30bb0e19b2a9e7d6
diff --git a/doc/salome/gui/SMESH/input/basic_meshing_algos.doc b/doc/salome/gui/SMESH/input/basic_meshing_algos.doc
index a4ebe1c8a..080727462 100644
--- a/doc/salome/gui/SMESH/input/basic_meshing_algos.doc
+++ b/doc/salome/gui/SMESH/input/basic_meshing_algos.doc
@@ -3,42 +3,55 @@
\page basic_meshing_algos_page Basic meshing algorithms
\n The MESH module contains a set of meshing algorithms, which are
-used for meshing entities (1D, 2D, 3D) composing geometrical objects.
+used for meshing entities (1D, 2D, 3D sub-shapes) composing
+geometrical objects.
+
+An algorithm represents either an implementation of a certain meshing
+technique or an interface to the whole meshing program generating elements
+of several dimensions.
- For meshing of 1D entities (edges):
-
+\anchor a1d_algos_anchor
-- Wire Discretisation meshing algorithm - splits a wire into a
-number of mesh segments following any 1D hypothesis.
-- Composite Side Discretisation algorithm - allows to apply any 1D
-hypothesis to a whole side of a geometrical face even if it is
-composed of several edges provided that they form C1 curve, have the
-same hypotheses assigned and form one side in all faces of the main
-shape of a mesh.
+- Wire Discretization meshing algorithm - splits an edge into a
+number of mesh segments following an 1D hypothesis.
+
+- Composite Side Discretization algorithm - allows to apply a 1D
+ hypothesis to a whole side of a geometrical face even if it is
+ composed of several edges provided that they form C1 curve in all
+ faces of the main shape.
- For meshing of 2D entities (faces):
-- Triangle meshing algorithms (Mefisto) - Faces are split into triangular elements.
-- Quadrangle meshing algorithm (Mapping) - quadrilateral Faces are split into
-quadrangular elements.
+- Triangle (Mefisto) meshing algorithm - splits faces
+ into triangular elements.
+- \subpage quad_ijk_algo_page "Quadrangle (Mapping)" meshing
+ algorithm - splits faces into quadrangular elements.
\image html image123.gif "Example of a triangular 2D mesh"
\image html image124.gif "Example of a quadrangular 2D mesh"
-- For meshing of 3D entities (volume objects):
+- For meshing of 3D entities (solid objects):
-- Hexahedron meshing algorithm (i,j,k) - 6-sided Volumes are split into
-hexahedral (cubic) elements.
-- \subpage cartesian_algo_page
-internal parts of Volumes are split into hexahedral elements forming a
-Cartesian grid; polyhedra and other types of elements are generated
-where the geometrical boundary intersects Cartesian cells.
+- Hexahedron (i,j,k) meshing algorithm - solids are
+ split into hexahedral elements thus forming a structured 3D
+ mesh. The algorithm requires that 2D mesh generated on a solid could
+ 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.
+\image html hexa_ijk_mesh.png "Structured mesh generated by Hexahedron (i,j,k) on a solid bound by 16 faces"
+
+
+- \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.
\image html image125.gif "Example of a tetrahedral 3D mesh"
@@ -46,25 +59,26 @@ where the geometrical boundary intersects Cartesian cells.
\image html image126.gif "Example of a hexahedral 3D mesh"
-Some of 3D meshing algorithms also can generate 3D meshes from 2D meshes, working without
-geometrical objects. Such algorithms are
-
-- Hexahedron meshing algorithm (i,j,k),
-
-
+Some 3D meshing algorithms, such as Hexahedron(i,j,k) also can
+generate 3D meshes from 2D meshes, working without geometrical
+objects.
There is also a number of more specific algorithms:
+- \subpage prism_3d_algo_page "for meshing prismatic 3D shapes with hexahedra and prisms"
+- \subpage quad_from_ma_algo_page "for quadrangle meshing of faces with sinuous borders"
+- Polygon per Face meshing algorithm - generates one mesh
+ face (either a triangle, a quadrangle or a polygon) per a geometrical
+ face using all nodes from the face boundary.
- \subpage projection_algos_page "for meshing by projection of another mesh"
- \subpage import_algos_page "for meshing by importing elements from another mesh"
-- \subpage radial_prism_algo_page "for meshing geometrical objects with cavities"
-- \subpage segments_around_vertex_algo_page "for defining the local size of elements around a certain node"
-- \subpage prism_3d_algo_page "for meshing prismatic shapes"
-- \subpage radial_quadrangle_1D2D_algo_page "for meshing special 2d faces (circles and part of circles)"
+- \subpage radial_prism_algo_page "for meshing 3D geometrical objects with cavities with hexahedra and prisms"
+- \subpage radial_quadrangle_1D2D_algo_page "for quadrangle meshing of disks and parts of disks"
+- \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.
+- \subpage segments_around_vertex_algo_page "for defining the length of mesh segments around certain vertices"
-\ref use_existing_anchor "Use existing edges" and
-\ref use_existing_anchor "Use existing faces" algorithms can be
-used to create an 1D or a 2D mesh in a python script.
\ref constructing_meshes_page "Constructing meshes" page describes in
detail how to apply meshing algorithms.