Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
Gmsh
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Analyze
Contributor analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
GitLab community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Gmsh
Gmsh
Commits
319d3ae7
Commit
319d3ae7
authored
Mar 7, 2019
by
Christophe Geuzaine
Browse files
Options
Downloads
Patches
Plain Diff
4.2.1
parent
cc0adeb9
Branches
Branches containing commit
Tags
Tags containing commit
No related merge requests found
Changes
4
Show whitespace changes
Inline
Side-by-side
Showing
4 changed files
CHANGELOG.txt
+4
-2
4 additions, 2 deletions
CHANGELOG.txt
doc/gmsh.html
+12
-12
12 additions, 12 deletions
doc/gmsh.html
doc/texinfo/gmsh.texi
+34
-34
34 additions, 34 deletions
doc/texinfo/gmsh.texi
doc/texinfo/opt_mesh.texi
+1
-1
1 addition, 1 deletion
doc/texinfo/opt_mesh.texi
with
51 additions
and
49 deletions
CHANGELOG.txt
+
4
−
2
View file @
319d3ae7
4.2.1 (March 7, 2019): fixed regression in STEP reader; added reading labels and
4.2.1 (March 7, 2019): fixed regression for STEP files without global compound
colors in IGES files; small improvements.
shape; added support for reading IGES labels and colors; improved search for
shared library in Python and Julia modules; improved Plugin(MeshVolume); updates
to the reference manual.
4.2.0 (March 5, 2019): changed type of node and element tags in API to support
4.2.0 (March 5, 2019): changed type of node and element tags in API to support
(very) large meshes (using size_t instead of int); new MSH4.1 revision of the
(very) large meshes (using size_t instead of int); new MSH4.1 revision of the
...
...
...
...
This diff is collapsed.
Click to expand it.
doc/gmsh.html
+
12
−
12
View file @
319d3ae7
...
@@ -88,21 +88,21 @@ Public License (GPL)</a>:
...
@@ -88,21 +88,21 @@ Public License (GPL)</a>:
<ul>
<ul>
<li>
<li>
<div
class=
"highlight"
>
<div
class=
"highlight"
>
Current stable release (version 4.2.
0
,
5
March 2019):
Current stable release (version 4.2.
1
,
7
March 2019):
<ul>
<ul>
<li>
Download Gmsh for
<li>
Download Gmsh for
<a
href=
"bin/Windows/gmsh-4.2.
0
-Windows64.zip"
>
Windows 64-bit
</a>
,
<a
href=
"bin/Windows/gmsh-4.2.
1
-Windows64.zip"
>
Windows 64-bit
</a>
,
<a
href=
"bin/Windows/gmsh-4.2.
0
-Windows32.zip"
>
Windows 32-bit
</a>
,
<a
href=
"bin/Windows/gmsh-4.2.
1
-Windows32.zip"
>
Windows 32-bit
</a>
,
<a
href=
"bin/Linux/gmsh-4.2.
0
-Linux64.tgz"
>
Linux 64-bit
</a>
,
<a
href=
"bin/Linux/gmsh-4.2.
1
-Linux64.tgz"
>
Linux 64-bit
</a>
,
<a
href=
"bin/Linux/gmsh-4.2.
0
-Linux32.tgz"
>
Linux 32-bit
</a>
or
<a
href=
"bin/Linux/gmsh-4.2.
1
-Linux32.tgz"
>
Linux 32-bit
</a>
or
<a
href=
"bin/MacOSX/gmsh-4.2.
0
-MacOSX.dmg"
>
MacOS
</a>
<a
href=
"bin/MacOSX/gmsh-4.2.
1
-MacOSX.dmg"
>
MacOS
</a>
<li>
Download the
<a
href=
"src/gmsh-4.2.
0
-source.tgz"
>
source code
</a>
<li>
Download the
<a
href=
"src/gmsh-4.2.
1
-source.tgz"
>
source code
</a>
<li>
Download the Software Development Kit (SDK) for
<li>
Download the Software Development Kit (SDK) for
<a
href=
"bin/Windows/gmsh-4.2.
0
-Windows64-sdk.zip"
>
Windows 64-bit
</a>
,
<a
href=
"bin/Windows/gmsh-4.2.
1
-Windows64-sdk.zip"
>
Windows 64-bit
</a>
,
<a
href=
"bin/Windows/gmsh-4.2.
0
-Windows32-sdk.zip"
>
Windows 32-bit
</a>
,
<a
href=
"bin/Windows/gmsh-4.2.
1
-Windows32-sdk.zip"
>
Windows 32-bit
</a>
,
<a
href=
"bin/Linux/gmsh-4.2.
0
-Linux64-sdk.tgz"
>
Linux 64-bit
</a>
,
<a
href=
"bin/Linux/gmsh-4.2.
1
-Linux64-sdk.tgz"
>
Linux 64-bit
</a>
,
<a
href=
"bin/Linux/gmsh-4.2.
0
-Linux32-sdk.tgz"
>
Linux 32-bit
</a>
or
<a
href=
"bin/Linux/gmsh-4.2.
1
-Linux32-sdk.tgz"
>
Linux 32-bit
</a>
or
<a
href=
"bin/MacOSX/gmsh-4.2.
0
-MacOSX-sdk.tgz"
>
MacOS
</a>
<a
href=
"bin/MacOSX/gmsh-4.2.
1
-MacOSX-sdk.tgz"
>
MacOS
</a>
</ul>
</ul>
</div>
</div>
<p>
<p>
...
...
...
...
This diff is collapsed.
Click to expand it.
doc/texinfo/gmsh.texi
+
34
−
34
View file @
319d3ae7
...
@@ -401,7 +401,7 @@ access to all usual constructive solid geometry operations;
...
@@ -401,7 +401,7 @@ access to all usual constructive solid geometry operations;
@item
@item
import geometries from other CAD software in standard exchange
import geometries from other CAD software in standard exchange
formats. Gmsh uses OpenCASCADE to import such files, including label and
formats. Gmsh uses OpenCASCADE to import such files, including label and
color information from STEP files;
color information from STEP
and IGES
files;
@item
@item
generate 1D, 2D and 3D simplicial (i.e., using line segments, triangles
generate 1D, 2D and 3D simplicial (i.e., using line segments, triangles
and tetrahedra) finite element meshes (see @ref
{
Mesh module
}
), with fine
and tetrahedra) finite element meshes (see @ref
{
Mesh module
}
), with fine
...
@@ -1707,7 +1707,7 @@ is not absolute, @var{char-expression} is appended to the path of the
...
@@ -1707,7 +1707,7 @@ is not absolute, @var{char-expression} is appended to the path of the
current file. @value
{
SYNC
}
current file. @value
{
SYNC
}
@item ShapeFromFile( @var
{
char-expression
}
);
@item ShapeFromFile( @var
{
char-expression
}
);
Merges a BREP
or
STEP file and returns the tags of the
Merges a BREP
,
STEP
or IGES
file and returns the tags of the
highest-dimensional entities. Only available with the OpenCASCADE
highest-dimensional entities. Only available with the OpenCASCADE
geometry kernel.
geometry kernel.
...
@@ -1842,10 +1842,11 @@ example the @code{Plane Surface} or @code{Surface} commands, or by
...
@@ -1842,10 +1842,11 @@ example the @code{Plane Surface} or @code{Surface} commands, or by
extruding curves), and finally volumes (using the @code
{
Volume
}
command
extruding curves), and finally volumes (using the @code
{
Volume
}
command
or by extruding surfaces). The OpenCASCADE kernel
or by extruding surfaces). The OpenCASCADE kernel
(@code
{
SetFactory("OpenCASCADE")
}
) allows to build models in the same
(@code
{
SetFactory("OpenCASCADE")
}
) allows to build models in the same
bottom-up manner, or using a constructive solid geometry approach, where
bottom-up manner, or by using a constructive solid geometry approach
solids are first defined, on which boolean operations are performed.
where solids are defined first. Boolean operations can then be performed
to modify them.
These geometrical entities are
call
ed ``elementary'' in Gmsh's jargon,
These geometrical entities are
dubb
ed ``elementary'' in Gmsh's jargon,
and are assigned tags (stricly positive global identification numbers)
and are assigned tags (stricly positive global identification numbers)
when they are created:
when they are created:
...
@@ -2560,7 +2561,7 @@ hexahedral meshes with the @code{Mesh.SubdivisionAlgorihm} option
...
@@ -2560,7 +2561,7 @@ hexahedral meshes with the @code{Mesh.SubdivisionAlgorihm} option
@node Choosing the right unstructured algorithm, Elementary entities vs physical groups, Mesh module, Mesh module
@node Choosing the right unstructured algorithm, Elementary entities vs physical groups, Mesh module, Mesh module
@section Choosing the right unstructured algorithm
@section Choosing the right unstructured algorithm
Gmsh
currently
provides a choice between several 2D and 3D unstructured
Gmsh provides a choice between several 2D and 3D unstructured
algorithms. Each algorithm has its own advantages and disadvantages.
algorithms. Each algorithm has its own advantages and disadvantages.
For all 2D unstructured algorithms a Delaunay mesh that contains all the
For all 2D unstructured algorithms a Delaunay mesh that contains all the
...
@@ -2597,7 +2598,7 @@ by means of Delaunay triangulation and Bowyer-Watson algorithm},
...
@@ -2597,7 +2598,7 @@ by means of Delaunay triangulation and Bowyer-Watson algorithm},
J. Comput. Phys. 106, pp. 25--138, 1993.
}
.
J. Comput. Phys. 106, pp. 25--138, 1993.
}
.
@item
@item
Other experimental algorithms with specific features are also
Other experimental algorithms with specific features are also
available. In particular, ``Frontal-Delaunay for
q
uads'' is a variant of
available. In particular, ``Frontal-Delaunay for
Q
uads'' is a variant of
the ``Frontal-Delaunay'' algorithm aiming at generating right-angle
the ``Frontal-Delaunay'' algorithm aiming at generating right-angle
triangles suitable for recombination; and ``BAMG''@footnote
{
F. Hecht,
triangles suitable for recombination; and ``BAMG''@footnote
{
F. Hecht,
@emph
{
BAMG: bidimensional anisotropic mesh generator
}
, User Guide,
@emph
{
BAMG: bidimensional anisotropic mesh generator
}
, User Guide,
...
@@ -2608,22 +2609,23 @@ triangulations.
...
@@ -2608,22 +2609,23 @@ triangulations.
For very complex curved surfaces the ``MeshAdapt'' algorithm is the most
For very complex curved surfaces the ``MeshAdapt'' algorithm is the most
robust. When high element quality is important, the ``Delaunay-Frontal''
robust. When high element quality is important, the ``Delaunay-Frontal''
algorithm should be tried. For very large meshes of plane surfaces the
algorithm should be tried. For very large meshes of plane surfaces the
``Delaunay'' algorithm is the fastest.
``Delaunay'' algorithm is the fastest. The ``Automatic'' algorithm
tries to select the best algorithm automatically for each surface in the
model: ``Delaunay'' for plane surfaces and ``MeshAdapt'' for all other
surfaces. When the ``Delaunay'' or ``Frontal-Delaunay'' algorithms fail,
``MeshAdapt'' is automatically triggered.
The ``Automatic'' algorithm tries to select the best algorithm
Several 3D unstructured algorithms are also available:
automatically for each surface in the model: ``Delaunay'' for plane
surfaces and ``MeshAdapt'' for all other surfaces. When the ``Delaunay''
or ``Frontal-Delaunay'' algorithms fail, ``MeshAdapt'' is automatically
triggered.
Several 3D unstructured algorithms are als available:
@itemize
@itemize
@item
@item
The ``Delaunay'' algorithm is split into two separate steps. First, an
The ``Delaunay'' algorithm is split into three separate steps. First, an
initial mesh of the union of all the volumes in the model is
initial mesh of the union of all the volumes in the model is performed,
performed. Then a three-dimensional version of the 2D Delaunay algorithm
without inserting points in the volume. The surface mesh is then
described above is applied.
recovered using H. Si's boundary recovery algorithm Tetgen/BR. Then a
three-dimensional version of the 2D Delaunay algorithm described above
is applied to insert points in the volume to respect the mesh size
constraints.
@item
@item
The ``Frontal'' algorithm uses J. Schoeberl's Netgen algorithm
The ``Frontal'' algorithm uses J. Schoeberl's Netgen algorithm
@footnote
{
J. Schoeberl, @emph
{
Netgen, an advancing front 2d/3d-mesh
@footnote
{
J. Schoeberl, @emph
{
Netgen, an advancing front 2d/3d-mesh
...
@@ -2646,25 +2648,23 @@ The ``Delaunay'' algorithm is currently the most robust and is the only
...
@@ -2646,25 +2648,23 @@ The ``Delaunay'' algorithm is currently the most robust and is the only
one that supports embedded geometrical entities, the @code
{
Field
}
one that supports embedded geometrical entities, the @code
{
Field
}
mechanism to specify element sizes (@pxref
{
Specifying mesh element
mechanism to specify element sizes (@pxref
{
Specifying mesh element
sizes
}
) and the automatic generation of hybrid meshes with
sizes
}
) and the automatic generation of hybrid meshes with
pyramids. These features will eventually be intergrated in the HXT
pyramids.
algorithm, which at that point will become the default 3D meshing
algorithm.
If your version of Gmsh is compile
r
with OpenMP support
If your version of Gmsh is compile
d
with OpenMP support
(@pxref
{
Compiling the source code
}
), most of the meshing steps can be
(@pxref
{
Compiling the source code
}
), most of the meshing steps can be
performed in parallel:
performed in parallel:
@itemize
@itemize
@item
@item
1D and 2D meshing is parallelized using a coarse-grain approach,
1D and 2D meshing is parallelized using a coarse-grain approach,
i.e. curves (resp. surfaces) are each meshed sequentially, but several
i.e. curves (resp. surfaces) are each meshed sequentially, but several
curves (resp. surfaces)
ar
e meshed at the same time.
curves (resp. surfaces)
can b
e meshed at the same time.
@item
@item
3D meshing using HXT is parallelized using a fine-grained approach,
3D meshing using HXT is parallelized using a fine-grained approach,
i.e. the actual meshing procedure for a single volume is done is
i.e. the actual meshing procedure for a single volume is done is
parallel.
parallel.
@end itemize
@end itemize
The number of threads
is
controlled
on
the co
mmand line with
the
The number of threads
can be
controlled
with
the
@
co
de
{
-nt
}
flag on
the
@
co
de
{
-nt
}
option
(@pxref
{
Command-line options
}
), or
using
the
co
mmand line
(@pxref
{
Command-line options
}
), or
with
the
@code
{
General.NumThreads
}
, @code
{
Mesh.MaxNumThreads1D
}
,
@code
{
General.NumThreads
}
, @code
{
Mesh.MaxNumThreads1D
}
,
@code
{
Mesh.MaxNumThreads2D
}
and @code
{
Mesh.MaxNumThreads3D
}
options (see
@code
{
Mesh.MaxNumThreads2D
}
and @code
{
Mesh.MaxNumThreads3D
}
options (see
@ref
{
General options list
}
and @ref
{
Mesh options list
}
).
@ref
{
General options list
}
and @ref
{
Mesh options list
}
).
...
@@ -3202,10 +3202,10 @@ as well as the way meshes are displayed in the GUI, is given in
...
@@ -3202,10 +3202,10 @@ as well as the way meshes are displayed in the GUI, is given in
@cindex Solver, module
@cindex Solver, module
@cindex Module, Solver
@cindex Module, Solver
Solvers can be driven by Gmsh through the ONELAB
Solvers can be driven by Gmsh through the ONELAB
interface (see
@url
{
http://www.onelab.info
}
interface
, which allows to run the solvers
@url
{
http://www.onelab.info
}
)
, which allows to run the solvers
have
have
them share parameters and modeling information. To add a new
them share parameters and modeling information. To add a new
external
external
solver, you need to specify its name (@code
{
Solver.Name0
}
,
solver, you need to specify its name (@code
{
Solver.Name0
}
,
@code
{
Solver.Name1
}
, etc.) and the path to the executable
@code
{
Solver.Name1
}
, etc.) and the path to the executable
(@code
{
Solver.Executable0
}
, @code
{
Solver.Executable1
}
, etc.). The list
(@code
{
Solver.Executable0
}
, @code
{
Solver.Executable1
}
, etc.). The list
of all the solver options is given in @ref
{
Solver options
of all the solver options is given in @ref
{
Solver options
...
@@ -3213,16 +3213,16 @@ list}. Examples on how to interface solvers are available in the source
...
@@ -3213,16 +3213,16 @@ list}. Examples on how to interface solvers are available in the source
distribution (in the
distribution (in the
@url
{
https://gitlab.onelab.info/gmsh/gmsh/tree/master/utils/solvers,utils/solvers
}
@url
{
https://gitlab.onelab.info/gmsh/gmsh/tree/master/utils/solvers,utils/solvers
}
directory). A full-featured solver interfaced in this manner is GetDP
directory). A full-featured solver interfaced in this manner is GetDP
(@uref
{
http://getdp.info
}
), a general finite element
s
solver using mixed
(@uref
{
http://getdp.info
}
), a general finite element solver using mixed
finite elements.
finite elements.
Using the Gmsh API, you can also directly embed
g
msh in your own solver,
Using the Gmsh API, you can also directly embed
G
msh in your own solver,
and use ONELAB for interactive parameter definition and
and use ONELAB for interactive parameter definition and
modification. See
modification. See
@url
{
https://gitlab.onelab.info/gmsh/gmsh/tree/master/demos/api/custom
_
gui.py,custom
_
gui.py
}
@url
{
https://gitlab.onelab.info/gmsh/gmsh/tree/master/demos/api/custom
_
gui.py,custom
_
gui.py
}
and
and
@url
{
https://gitlab.onelab.info/gmsh/gmsh/tree/master/demos/api/custom
_
gui.cpp,custom
_
gui.cpp
}
)
for
@url
{
https://gitlab.onelab.info/gmsh/gmsh/tree/master/demos/api/custom
_
gui.cpp,custom
_
gui.cpp
}
)
examples.
for
examples.
@c =========================================================================
@c =========================================================================
@c Post-processing module
@c Post-processing module
...
...
...
...
This diff is collapsed.
Click to expand it.
doc/texinfo/opt_mesh.texi
+
1
−
1
View file @
319d3ae7
...
@@ -2,7 +2,7 @@
...
@@ -2,7 +2,7 @@
@ftable @code
@ftable @code
@item Mesh.Algorithm
@item Mesh.Algorithm
2D mesh algorithm (1: MeshAdapt, 2: Automatic, 5: Delaunay, 6: Frontal, 7: BAMG, 8:
DelQuad
)@*
2D mesh algorithm (1: MeshAdapt, 2: Automatic, 5: Delaunay, 6: Frontal
-Delaunay
, 7: BAMG, 8:
Frontal-Delaunay for Quads, 9: Packing of Parallelograms
)@*
Default value: @code{2}@*
Default value: @code{2}@*
Saved in: @code{General.OptionsFileName}
Saved in: @code{General.OptionsFileName}
...
...
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment