X-Git-Url: http://git.salome-platform.org/gitweb/?a=blobdiff_plain;f=doc%2Fsalome%2Fgui%2FSMESH%2Finput%2Fbasic_meshing_algos.doc;h=08841b0637c44219cbf73a28e8d8af65f5948d41;hb=dd0d39d752a4d5ba58ed2e417651093764bb8d09;hp=fa177252462f6357534a39161b21e9db72c5a03a;hpb=79b1ac2b6df9117f16f11d444b1f165d477a1813;p=modules%2Fsmesh.git

diff --git a/doc/salome/gui/SMESH/input/basic_meshing_algos.doc b/doc/salome/gui/SMESH/input/basic_meshing_algos.doc
index fa1772524..08841b063 100644
--- a/doc/salome/gui/SMESH/input/basic_meshing_algos.doc
+++ b/doc/salome/gui/SMESH/input/basic_meshing_algos.doc
@@ -3,53 +3,79 @@
 \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 Discretisation meshing algorithm - splits a wire into a
-number of mesh segments following any 1D hypothesis.</li>
-<li>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.</li>
+<li><b>Wire Discretization</b> meshing algorithm - splits an edge into a
+number of mesh segments following an 1D hypothesis.
+</li>
+<li><b>Composite Side Discretization</b> 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 and Netgen 1D-2D ) - Faces
-are split into triangular elements.</li>
-<li>Quadrangle meshing algorithm (Mapping) - Faces are split into
-quadrangular elements.</li>
+<li><b>Triangle: Mefisto</b> 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
+\image html image123.gif "Example of a triangular 2D mesh"
 
-\image html image124.gif
+\image html image124.gif "Example of a quadrangular 2D mesh"
 
-<li>For meshing of 3D entities (<b>volume objects</b>):</li>
+<li>For meshing of 3D entities (<b>solid objects</b>):</li>
 
 <ul>
-<li>Hexahedron meshing algorithm (i,j,k) - Volumes are split into
-hexahedral (cubic) elements.</li>
-<li>Tetrahedron (Netgen) meshing algorithm - Volumes are split into
-tetrahedral (pyramidal) elements.</li>
+<li><b>Hexahedron (i,j,k)</b> 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"
+</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
+\image html image125.gif "Example of a tetrahedral 3D mesh"
 
-\image html image126.gif
+\image html image126.gif "Example of a hexahedral 3D mesh"
 </ul>
 
-There also is a number of more specific algorithms:
+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:
 <ul>
-<li>\ref projection_algos_page "for meshing by projection of another mesh"</li>
-<li>\ref radial_prism_algo_page "for meshing geometrical objects with cavities"</li>
-<li>\ref prism_3d_algo_page "for meshing prismatic shapes"</li>
+<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>
+<li> <b>Polygon per Face</b> 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 "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>
 </ul>
 
 \ref constructing_meshes_page "Constructing meshes" page describes in
@@ -58,4 +84,4 @@ 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.  
 
-*/
\ No newline at end of file
+*/