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
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Larry Price
gmsh
Commits
c75a03d4
Commit
c75a03d4
authored
15 years ago
by
Christophe Geuzaine
Browse files
Options
Downloads
Patches
Plain Diff
*** empty log message ***
parent
58b98d1c
No related branches found
No related tags found
No related merge requests found
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
doc/texinfo/gmsh.texi
+8
-6
8 additions, 6 deletions
doc/texinfo/gmsh.texi
doc/texinfo/opt_fields.texi
+38
-0
38 additions, 0 deletions
doc/texinfo/opt_fields.texi
with
46 additions
and
6 deletions
doc/texinfo/gmsh.texi
+
8
−
6
View file @
c75a03d4
...
...
@@ -2235,12 +2235,14 @@ algorithm@footnote{J. Schoeberl, @emph{Netgen, an advancing front
pp. 41--52, 1997.
}
.
@end enumerate
The ``Delaunay'' algorithm is the most robust and the fastest. However,
this algorithm will sometimes modify the surface mesh, and is thus not
suitable for producing hybrid structured/unstructured grids. In that
case the ``Frontal'' algorithm should be preferred. The quality of the
elements produced by both algorithms is comparable. If element quality
is important the mesh optimizer(s) should be applied.
The ``Delaunay'' algorithm is the most robust and the fastest, and is
the only one that supports the @code
{
Field
}
mechanism to specify element
sizes (@pxref
{
Characteristic lengths
}
). However, this algorithm will
sometimes modify the surface mesh, and is thus not suitable for
producing hybrid structured/unstructured grids. In that case the
``Frontal'' algorithm should be preferred. The quality of the elements
produced by both algorithms is comparable. If element quality is
important the mesh optimizer(s) should be applied.
@c -------------------------------------------------------------------------
@c Elementary vs. physical entities
...
...
This diff is collapsed.
Click to expand it.
doc/texinfo/opt_fields.texi
+
38
−
0
View file @
c75a03d4
...
...
@@ -30,6 +30,44 @@ type: list@*
default value: @code{@{@}}
@end table
@item BoundaryLayer
F = LCMin if Field[IField] <= DistMin,@*
F = LCMax if Field[IField] >= DistMax,@*
F = interpolation between LcMin and LcMax if DistMin < Field[IField] < DistMax@*
Options:@*
@table @code
@item DistMax
Distance from entity after which element size will be LcMax@*
type: float@*
default value: @code{10}
@item DistMin
Distance from entity up to which element size will be LcMin@*
type: float@*
default value: @code{1}
@item IField
Index of the field to evaluate@*
type: integer@*
default value: @code{0}
@item LcMax
Element size outside DistMax@*
type: float@*
default value: @code{1}
@item LcMin
Element size inside DistMin@*
type: float@*
default value: @code{0.1}
@item Sigmoid
True to interpolate between LcMin and LcMax using a sigmoid,
false to interpolate linearly@*
type: boolean@*
default value: @code{0}
@item StopAtDistMax
True to not impose element size outside DistMax (i.e.,
F = a very big value if Field[IField] > DistMax)@*
type: boolean@*
default value: @code{0}
@end table
@item Box
The value of this field is VIn inside the box, VOut outside the box.@*
The box is given by@*
...
...
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