Some improvements

This commit is contained in:
eap 2013-05-29 13:36:40 +00:00
parent e9f23d7589
commit 6609664fc3
3 changed files with 8 additions and 10 deletions

View File

@ -5,13 +5,12 @@
\b Hypotheses represent boundary conditions which will be taken into
account at calculations of meshes or sub-meshes basing on geometrical
objects. These hypotheses allow you to manage the level of detail of
the resulting meshes or submeshes: when applying different hypotheses
with different parameters you can preset the quantity of meshing
the resulting meshes or sub-meshes: when applying different hypotheses
with different parameters you can preset the quantity or size of
elements which will compose your mesh. So, it will be possible to
generate a coarse or a more refined mesh or sub-mesh.
In \b MESH there are the following Basic Hypotheses (to introduce
them, you operate numerical values):
In \b MESH there are the following Basic Hypotheses:
<ul>
<li>\subpage a1d_meshing_hypo_page "1D Hypotheses" (for meshing of
<b>edges</b>):</li>
@ -49,9 +48,8 @@ with other hypotheses:
The choice of a hypothesis depends on:
<ul>
<li>the geometrical object (shape) which will be meshed</li>
<li>the algorithm, which will be selected for meshing of this geometrical object (shape)</li>
<li>the geometrical object (shape) which will be meshed</li>
</ul>
*/

View File

@ -30,13 +30,13 @@ quadrangular elements.</li>
\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) - 6-sided Volumes are split into
<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 Volumes are split into hexahedral elements forming a
- 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>
</ul>

View File

@ -251,7 +251,7 @@ And the last mesh computation is made with:
<em>"Result mesh with order SubMesh_3, SubMesh_2, SubMesh_1 "</em></center>
As we can see, each mesh computation has a different number of result
elements and a different mesh discretisation on the shared edges (the edges
elements and a different mesh discretization on the shared edges (the edges
that are shared between <b>Face_1</b>, <b>Face_2</b> and <b>Face_3</b>)
Additionally, submesh priority (the order of applied algorithms) can