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
2f35db1b
Commit
2f35db1b
authored
11 years ago
by
Christophe Geuzaine
Browse files
Options
Downloads
Patches
Plain Diff
enable new initial delaunay for testing nightly builds
parent
422037ce
No related branches found
No related tags found
No related merge requests found
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
Mesh/meshGFace.cpp
+46
-45
46 additions, 45 deletions
Mesh/meshGFace.cpp
with
46 additions
and
45 deletions
Mesh/meshGFace.cpp
+
46
−
45
View file @
2f35db1b
...
...
@@ -46,9 +46,11 @@
#include
"boundaryLayersData.h"
#include
"filterElements.h"
// new quad code
// new initial delaunay
#define OLD_CODE 1
// define this to use the old initial delaunay
//#define OLD_TRI_CODE
// define this to use th old quad code
#define OLD_QUAD_CODE
static
void
computeElementShapes
(
GFace
*
gf
,
double
&
worst
,
double
&
avg
,
double
&
best
,
int
&
nT
,
int
&
greaterThan
)
...
...
@@ -1194,15 +1196,14 @@ bool meshGenerator(GFace *gf, int RECUR_ITER,
bbox
.
makeCube
();
// compute the bounding box in parametric space
SVector3
dd
(
bbox
.
max
(),
bbox
.
min
());
double
LC2D
=
norm
(
dd
);
// use a divide & conquer type algorithm to create a triangulation.
// We add to the triangulation a box with 4 points that encloses the
// domain.
#ifdef
OLD
_CODE
#if
def
ined(OLD_TRI
_CODE
)
{
// compute the bounding box in parametric space
SVector3
dd
(
bbox
.
max
(),
bbox
.
min
());
double
LC2D
=
norm
(
dd
);
DocRecord
doc
(
points
.
size
()
+
4
);
for
(
unsigned
int
i
=
0
;
i
<
points
.
size
();
i
++
){
double
XX
=
CTX
::
instance
()
->
mesh
.
randFactor
*
LC2D
*
(
double
)
rand
()
/
...
...
@@ -2050,7 +2051,7 @@ static bool meshGeneratorPeriodic(GFace *gf, bool debug = true)
// Use a divide & conquer type algorithm to create a triangulation.
// We add to the triangulation a box with 4 points that encloses the
// domain.
#if 1 //OLD_CODE
#if 1 //OLD_
TRI_
CODE
{
DocRecord
doc
(
nbPointsTotal
+
4
);
int
count
=
0
;
...
...
@@ -2561,7 +2562,7 @@ void meshGFace::operator() (GFace *gf, bool print)
return
;
}
#ifdef
OL
D_CODE
#if
!
def
ined(OLD_QUA
D_CODE
)
quadMeshRemoveHalfOfOneDMesh
halfmesh
(
gf
);
#endif
...
...
@@ -2581,7 +2582,7 @@ void meshGFace::operator() (GFace *gf, bool print)
Msg
::
Debug
(
"Type %d %d triangles generated, %d internal vertices"
,
gf
->
geomType
(),
gf
->
triangles
.
size
(),
gf
->
mesh_vertices
.
size
());
#ifdef
OL
D_CODE
#if
!
def
ined(OLD_QUA
D_CODE
)
halfmesh
.
finish
();
#endif
}
...
...
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