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=4804800c533b0239e873da8f6c3d2a4d45d169c0;hp=977b505dbad674d72220d8e33e9aaf5a4363c7bb;hb=fe7d1d57677486d8c546226dc2bf573fbfb6679d;hpb=b21a1e5b25983280805e04c04b166b9c12bba0af

diff --git a/doc/salome/gui/SMESH/input/basic_meshing_algos.doc b/doc/salome/gui/SMESH/input/basic_meshing_algos.doc
index 977b505db..4804800c5 100644
--- a/doc/salome/gui/SMESH/input/basic_meshing_algos.doc
+++ b/doc/salome/gui/SMESH/input/basic_meshing_algos.doc
@@ -3,27 +3,33 @@
 \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.
 
 <ul>
 <li>For meshing of 1D entities (<b>edges</b>):</li>
-
+\anchor a1d_algos_anchor
 <ul>
-<li>Wire Discretization meshing algorithm - splits a wire into a
-number of mesh segments following any 1D hypothesis.</li>
-<li>Composite Side Discretization 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.</li>
+<li><em>Wire Discretization</em> meshing algorithm - splits an edge into a
+number of mesh segments following an 1D hypothesis.
+</li>
+<li><em>Composite Side Discretization</em> 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.</li>
 </ul>
 
 <li>For meshing of 2D entities (<b>faces</b>):</li>
 
 <ul>
-<li>Triangle meshing algorithms (Mefisto) - Faces are split into triangular elements.</li>
-<li>Quadrangle meshing algorithm (Mapping) - quadrilateral Faces are split into
-quadrangular elements.</li>
+<li><em>Triangle (Mefisto)</em> meshing algorithm - splits faces
+  into triangular elements.</li>
+<li>\subpage quad_ijk_algo_page "Quadrangle (Mapping)" meshing
+  algorithm - splits faces into quadrangular elements.</li>
 </ul>
 
 \image html image123.gif "Example of a triangular 2D mesh"
@@ -33,12 +39,12 @@ quadrangular elements.</li>
 <li>For meshing of 3D entities (<b>solid objects</b>):</li>
 
 <ul>
-<li>Hexahedron meshing algorithm (i,j,k) - 6-sided Solids are split into
-hexahedral (cubic) elements.</li>
-<li>\subpage cartesian_algo_page</li>
-- internal parts of 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>
+<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>
 </ul>
 
 \image html image125.gif "Example of a tetrahedral 3D mesh"
@@ -47,12 +53,16 @@ where the geometrical boundary intersects Cartesian cells.</li>
 </ul>
 
 Some 3D meshing algorithms, such as Hexahedron(i,j,k) and some
-commercial ones, also can generate 3D meshes from 2D meshes, working without
-geometrical objects. 
+commercial ones, also can generate 3D meshes from 2D meshes, working
+without geometrical objects.
 
 There is also a number of more specific algorithms:
 <ul>
-<li>\subpage prism_3d_algo_page "for meshing prismatic shapes"</li>
+<li>\subpage prism_3d_algo_page "for meshing prismatic 3D shapes"</li>
+<li>\subpage quad_from_ma_algo_page "for meshing faces with sinuous borders"</li>
+<li> <em>Polygon per Face</em> 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.</li>
 <li>\subpage projection_algos_page "for meshing by projection of another mesh"</li>
 <li>\subpage import_algos_page "for meshing by importing elements from another mesh"</li>
 <li>\subpage radial_prism_algo_page "for meshing geometrical objects with cavities"</li>