This commit is contained in:
eap 2013-01-28 08:54:11 +00:00
parent 0cd977f8bf
commit af68a622d3

View File

@ -36,7 +36,7 @@ quadrangular elements.</li>
<li>Hexahedron meshing algorithm (i,j,k) - 6-sided Volumes are split into <li>Hexahedron meshing algorithm (i,j,k) - 6-sided Volumes are split into
hexahedral (cubic) elements.</li> hexahedral (cubic) elements.</li>
<li>\subpage cartesian_algo_page</li> <li>\subpage cartesian_algo_page</li>
internal parts of Volumes are split into hexahedral elements forming a - internal parts of Volumes are split into hexahedral elements forming a
Cartesian grid; polyhedra and other types of elements are generated Cartesian grid; polyhedra and other types of elements are generated
where the geometrical boundary intersects Cartesian cells.</li> where the geometrical boundary intersects Cartesian cells.</li>
</ul> </ul>
@ -47,7 +47,7 @@ where the geometrical boundary intersects Cartesian cells.</li>
</ul> </ul>
Some of 3D meshing algorithms also can generate 3D meshes from 2D meshes, working without Some of 3D meshing algorithms also can generate 3D meshes from 2D meshes, working without
geometrical objects. Such algorithms are geometrical objects. Such algorithms is
<ul> <ul>
<li>Hexahedron meshing algorithm (i,j,k),</li> <li>Hexahedron meshing algorithm (i,j,k),</li>
<!-- <li>GHS3D meshing algorithm (commercial)</li> --> <!-- <li>GHS3D meshing algorithm (commercial)</li> -->