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
5453afb2
Commit
5453afb2
authored
11 years ago
by
Jean-François Remacle
Browse files
Options
Downloads
Patches
Plain Diff
periodic mesher is now "more" deterministic
parent
c08e1c4c
No related branches found
Branches containing commit
No related tags found
Tags containing commit
No related merge requests found
Changes
3
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
Mesh/meshGFace.cpp
+9
-9
9 additions, 9 deletions
Mesh/meshGFace.cpp
Mesh/meshGFaceBDS.cpp
+5
-5
5 additions, 5 deletions
Mesh/meshGFaceBDS.cpp
Mesh/meshGFaceBDS.h
+2
-1
2 additions, 1 deletion
Mesh/meshGFaceBDS.h
with
16 additions
and
15 deletions
Mesh/meshGFace.cpp
+
9
−
9
View file @
5453afb2
...
@@ -543,7 +543,7 @@ static bool recoverEdge(BDS_Mesh *m, GEdge *ge,
...
@@ -543,7 +543,7 @@ static bool recoverEdge(BDS_Mesh *m, GEdge *ge,
return
true
;
return
true
;
}
}
void
BDS2GMSH
(
BDS_Mesh
*
m
,
GFace
*
gf
,
std
::
map
<
BDS_Point
*
,
MVertex
*>
&
recoverMap
)
void
BDS2GMSH
(
BDS_Mesh
*
m
,
GFace
*
gf
,
std
::
map
<
BDS_Point
*
,
MVertex
*
,
PointLessThan
>
&
recoverMap
)
{
{
{
{
std
::
set
<
BDS_Point
*
,
PointLessThan
>::
iterator
itp
=
m
->
points
.
begin
();
std
::
set
<
BDS_Point
*
,
PointLessThan
>::
iterator
itp
=
m
->
points
.
begin
();
...
@@ -767,7 +767,7 @@ bool meshGenerator(GFace *gf, int RECUR_ITER,
...
@@ -767,7 +767,7 @@ bool meshGenerator(GFace *gf, int RECUR_ITER,
//onlyInitialMesh=true;
//onlyInitialMesh=true;
BDS_GeomEntity
CLASS_F
(
1
,
2
);
BDS_GeomEntity
CLASS_F
(
1
,
2
);
BDS_GeomEntity
CLASS_EXTERIOR
(
1
,
3
);
BDS_GeomEntity
CLASS_EXTERIOR
(
1
,
3
);
std
::
map
<
BDS_Point
*
,
MVertex
*>
recoverMap
;
std
::
map
<
BDS_Point
*
,
MVertex
*
,
PointLessThan
>
recoverMap
;
std
::
map
<
MVertex
*
,
BDS_Point
*>
recoverMapInv
;
std
::
map
<
MVertex
*
,
BDS_Point
*>
recoverMapInv
;
std
::
list
<
GEdge
*>
edges
=
replacement_edges
?
*
replacement_edges
:
gf
->
edges
();
std
::
list
<
GEdge
*>
edges
=
replacement_edges
?
*
replacement_edges
:
gf
->
edges
();
std
::
list
<
int
>
dir
=
gf
->
edgeOrientations
();
std
::
list
<
int
>
dir
=
gf
->
edgeOrientations
();
...
@@ -1110,7 +1110,7 @@ bool meshGenerator(GFace *gf, int RECUR_ITER,
...
@@ -1110,7 +1110,7 @@ bool meshGenerator(GFace *gf, int RECUR_ITER,
edgesToRecover
.
size
());
edgesToRecover
.
size
());
for
(
int
i
=
0
;
i
<
doc
.
numPoints
;
i
++
){
for
(
int
i
=
0
;
i
<
doc
.
numPoints
;
i
++
){
BDS_Point
*
pp
=
(
BDS_Point
*
)
doc
.
points
[
i
].
data
;
BDS_Point
*
pp
=
(
BDS_Point
*
)
doc
.
points
[
i
].
data
;
std
::
map
<
BDS_Point
*
,
MVertex
*>::
iterator
itv
=
recoverMap
.
find
(
pp
);
std
::
map
<
BDS_Point
*
,
MVertex
*
,
PointLessThan
>::
iterator
itv
=
recoverMap
.
find
(
pp
);
if
(
itv
!=
recoverMap
.
end
()){
if
(
itv
!=
recoverMap
.
end
()){
MVertex
*
here
=
itv
->
second
;
MVertex
*
here
=
itv
->
second
;
GEntity
*
ge
=
here
->
onWhat
();
GEntity
*
ge
=
here
->
onWhat
();
...
@@ -1349,7 +1349,7 @@ static void printMesh1d(int iEdge, int seam, std::vector<SPoint2> &m)
...
@@ -1349,7 +1349,7 @@ static void printMesh1d(int iEdge, int seam, std::vector<SPoint2> &m)
static
bool
buildConsecutiveListOfVertices
(
GFace
*
gf
,
GEdgeLoop
&
gel
,
static
bool
buildConsecutiveListOfVertices
(
GFace
*
gf
,
GEdgeLoop
&
gel
,
std
::
vector
<
BDS_Point
*>
&
result
,
std
::
vector
<
BDS_Point
*>
&
result
,
SBoundingBox3d
&
bbox
,
BDS_Mesh
*
m
,
SBoundingBox3d
&
bbox
,
BDS_Mesh
*
m
,
std
::
map
<
BDS_Point
*
,
MVertex
*>
&
recoverMap
,
std
::
map
<
BDS_Point
*
,
MVertex
*
,
PointLessThan
>
&
recoverMap
,
int
&
count
,
int
countTot
,
double
tol
,
int
&
count
,
int
countTot
,
double
tol
,
bool
seam_the_first
=
false
)
bool
seam_the_first
=
false
)
{
{
...
@@ -1362,7 +1362,7 @@ static bool buildConsecutiveListOfVertices(GFace *gf, GEdgeLoop &gel,
...
@@ -1362,7 +1362,7 @@ static bool buildConsecutiveListOfVertices(GFace *gf, GEdgeLoop &gel,
const
int
MYDEBUG
=
false
;
const
int
MYDEBUG
=
false
;
std
::
map
<
BDS_Point
*
,
MVertex
*>
recoverMapLocal
;
std
::
map
<
BDS_Point
*
,
MVertex
*
,
PointLessThan
>
recoverMapLocal
;
result
.
clear
();
result
.
clear
();
count
=
0
;
count
=
0
;
...
@@ -1505,7 +1505,7 @@ static bool buildConsecutiveListOfVertices(GFace *gf, GEdgeLoop &gel,
...
@@ -1505,7 +1505,7 @@ static bool buildConsecutiveListOfVertices(GFace *gf, GEdgeLoop &gel,
// It has not worked : either tolerance is wrong or the first seam edge
// It has not worked : either tolerance is wrong or the first seam edge
// has to be taken with the other parametric coordinates (because it is
// has to be taken with the other parametric coordinates (because it is
// only present once in the closure of the domain).
// only present once in the closure of the domain).
for
(
std
::
map
<
BDS_Point
*
,
MVertex
*>::
iterator
it
=
recoverMapLocal
.
begin
();
for
(
std
::
map
<
BDS_Point
*
,
MVertex
*
,
PointLessThan
>::
iterator
it
=
recoverMapLocal
.
begin
();
it
!=
recoverMapLocal
.
end
();
++
it
){
it
!=
recoverMapLocal
.
end
();
++
it
){
m
->
del_point
(
it
->
first
);
m
->
del_point
(
it
->
first
);
}
}
...
@@ -1600,7 +1600,7 @@ static bool meshGeneratorElliptic(GFace *gf, bool debug = true)
...
@@ -1600,7 +1600,7 @@ static bool meshGeneratorElliptic(GFace *gf, bool debug = true)
static
bool
meshGeneratorPeriodic
(
GFace
*
gf
,
bool
debug
=
true
)
static
bool
meshGeneratorPeriodic
(
GFace
*
gf
,
bool
debug
=
true
)
{
{
std
::
map
<
BDS_Point
*
,
MVertex
*>
recoverMap
;
std
::
map
<
BDS_Point
*
,
MVertex
*
,
PointLessThan
>
recoverMap
;
Range
<
double
>
rangeU
=
gf
->
parBounds
(
0
);
Range
<
double
>
rangeU
=
gf
->
parBounds
(
0
);
Range
<
double
>
rangeV
=
gf
->
parBounds
(
1
);
Range
<
double
>
rangeV
=
gf
->
parBounds
(
1
);
...
@@ -1661,7 +1661,7 @@ static bool meshGeneratorPeriodic(GFace *gf, bool debug = true)
...
@@ -1661,7 +1661,7 @@ static bool meshGeneratorPeriodic(GFace *gf, bool debug = true)
if
(
nbPointsTotal
==
3
){
if
(
nbPointsTotal
==
3
){
MVertex
*
vv
[
3
];
MVertex
*
vv
[
3
];
int
i
=
0
;
int
i
=
0
;
for
(
std
::
map
<
BDS_Point
*
,
MVertex
*>::
iterator
it
=
recoverMap
.
begin
();
for
(
std
::
map
<
BDS_Point
*
,
MVertex
*
,
PointLessThan
>::
iterator
it
=
recoverMap
.
begin
();
it
!=
recoverMap
.
end
();
it
++
){
it
!=
recoverMap
.
end
();
it
++
){
vv
[
i
++
]
=
it
->
second
;
vv
[
i
++
]
=
it
->
second
;
}
}
...
@@ -1891,7 +1891,7 @@ static bool meshGeneratorPeriodic(GFace *gf, bool debug = true)
...
@@ -1891,7 +1891,7 @@ static bool meshGeneratorPeriodic(GFace *gf, bool debug = true)
std
::
map
<
MVertex
*
,
SPoint2
>
parametricCoordinates
;
std
::
map
<
MVertex
*
,
SPoint2
>
parametricCoordinates
;
if
(
algoDelaunay2D
(
gf
)){
if
(
algoDelaunay2D
(
gf
)){
std
::
map
<
MVertex
*
,
BDS_Point
*>
invertMap
;
std
::
map
<
MVertex
*
,
BDS_Point
*>
invertMap
;
std
::
map
<
BDS_Point
*
,
MVertex
*>::
iterator
it
=
recoverMap
.
begin
();
std
::
map
<
BDS_Point
*
,
MVertex
*
,
PointLessThan
>::
iterator
it
=
recoverMap
.
begin
();
while
(
it
!=
recoverMap
.
end
()){
while
(
it
!=
recoverMap
.
end
()){
// we have twice vertex MVertex with 2 different coordinates
// we have twice vertex MVertex with 2 different coordinates
MVertex
*
mv1
=
it
->
second
;
MVertex
*
mv1
=
it
->
second
;
...
...
This diff is collapsed.
Click to expand it.
Mesh/meshGFaceBDS.cpp
+
5
−
5
View file @
5453afb2
...
@@ -746,7 +746,7 @@ void allowAppearanceofEdge (BDS_Point *p1, BDS_Point *p2)
...
@@ -746,7 +746,7 @@ void allowAppearanceofEdge (BDS_Point *p1, BDS_Point *p2)
{
{
}
}
void
invalidEdgesPeriodic
(
BDS_Mesh
&
m
,
std
::
map
<
BDS_Point
*
,
MVertex
*>
*
recoverMap
,
void
invalidEdgesPeriodic
(
BDS_Mesh
&
m
,
std
::
map
<
BDS_Point
*
,
MVertex
*
,
PointLessThan
>
*
recoverMap
,
std
::
set
<
BDS_Edge
*>
&
toSplit
)
std
::
set
<
BDS_Edge
*>
&
toSplit
)
{
{
// first look for degenerated vertices
// first look for degenerated vertices
...
@@ -755,8 +755,8 @@ void invalidEdgesPeriodic(BDS_Mesh &m, std::map<BDS_Point*, MVertex*> *recoverMa
...
@@ -755,8 +755,8 @@ void invalidEdgesPeriodic(BDS_Mesh &m, std::map<BDS_Point*, MVertex*> *recoverMa
while
(
it
!=
m
.
edges
.
end
()){
while
(
it
!=
m
.
edges
.
end
()){
BDS_Edge
*
e
=
*
it
;
BDS_Edge
*
e
=
*
it
;
if
(
!
e
->
deleted
&&
e
->
numfaces
()
==
1
){
if
(
!
e
->
deleted
&&
e
->
numfaces
()
==
1
){
std
::
map
<
BDS_Point
*
,
MVertex
*>::
iterator
itp1
=
recoverMap
->
find
(
e
->
p1
);
std
::
map
<
BDS_Point
*
,
MVertex
*
,
PointLessThan
>::
iterator
itp1
=
recoverMap
->
find
(
e
->
p1
);
std
::
map
<
BDS_Point
*
,
MVertex
*>::
iterator
itp2
=
recoverMap
->
find
(
e
->
p2
);
std
::
map
<
BDS_Point
*
,
MVertex
*
,
PointLessThan
>::
iterator
itp2
=
recoverMap
->
find
(
e
->
p2
);
if
(
itp1
!=
recoverMap
->
end
()
&&
itp2
!=
recoverMap
->
end
()
&&
if
(
itp1
!=
recoverMap
->
end
()
&&
itp2
!=
recoverMap
->
end
()
&&
itp1
->
second
==
itp2
->
second
){
itp1
->
second
==
itp2
->
second
){
degenerated
.
insert
(
itp1
->
second
);
degenerated
.
insert
(
itp1
->
second
);
...
@@ -807,7 +807,7 @@ void invalidEdgesPeriodic(BDS_Mesh &m, std::map<BDS_Point*, MVertex*> *recoverMa
...
@@ -807,7 +807,7 @@ void invalidEdgesPeriodic(BDS_Mesh &m, std::map<BDS_Point*, MVertex*> *recoverMa
// if p1 p2 exists and it is internal, split it
// if p1 p2 exists and it is internal, split it
int
solveInvalidPeriodic
(
GFace
*
gf
,
BDS_Mesh
&
m
,
int
solveInvalidPeriodic
(
GFace
*
gf
,
BDS_Mesh
&
m
,
std
::
map
<
BDS_Point
*
,
MVertex
*>
*
recoverMap
)
std
::
map
<
BDS_Point
*
,
MVertex
*
,
PointLessThan
>
*
recoverMap
)
{
{
std
::
set
<
BDS_Edge
*>
toSplit
;
std
::
set
<
BDS_Edge
*>
toSplit
;
invalidEdgesPeriodic
(
m
,
recoverMap
,
toSplit
);
invalidEdgesPeriodic
(
m
,
recoverMap
,
toSplit
);
...
@@ -836,7 +836,7 @@ int solveInvalidPeriodic(GFace *gf, BDS_Mesh &m,
...
@@ -836,7 +836,7 @@ int solveInvalidPeriodic(GFace *gf, BDS_Mesh &m,
}
}
void
optimizeMeshBDS
(
GFace
*
gf
,
BDS_Mesh
&
m
,
const
int
NIT
,
void
optimizeMeshBDS
(
GFace
*
gf
,
BDS_Mesh
&
m
,
const
int
NIT
,
std
::
map
<
BDS_Point
*
,
MVertex
*>
*
recoverMap
=
0
)
std
::
map
<
BDS_Point
*
,
MVertex
*
,
PointLessThan
>
*
recoverMap
=
0
)
{
{
int
nb_swap
;
int
nb_swap
;
delaunayizeBDS
(
gf
,
m
,
nb_swap
);
delaunayizeBDS
(
gf
,
m
,
nb_swap
);
...
...
This diff is collapsed.
Click to expand it.
Mesh/meshGFaceBDS.h
+
2
−
1
View file @
5453afb2
...
@@ -8,6 +8,7 @@
...
@@ -8,6 +8,7 @@
#include
<map>
#include
<map>
#include
<list>
#include
<list>
#include
"BDS.h"
class
GFace
;
class
GFace
;
class
GModel
;
class
GModel
;
...
@@ -22,7 +23,7 @@ void refineMeshBDS(GFace *gf, BDS_Mesh &m, const int NIT,
...
@@ -22,7 +23,7 @@ void refineMeshBDS(GFace *gf, BDS_Mesh &m, const int NIT,
const
bool
computeNodalSizeField
,
const
bool
computeNodalSizeField
,
std
::
map
<
MVertex
*
,
BDS_Point
*>
*
recoverMapInv
=
0
);
std
::
map
<
MVertex
*
,
BDS_Point
*>
*
recoverMapInv
=
0
);
void
optimizeMeshBDS
(
GFace
*
gf
,
BDS_Mesh
&
m
,
const
int
NIT
,
void
optimizeMeshBDS
(
GFace
*
gf
,
BDS_Mesh
&
m
,
const
int
NIT
,
std
::
map
<
BDS_Point
*
,
MVertex
*>
*
recoverMap
=
0
);
std
::
map
<
BDS_Point
*
,
MVertex
*
,
PointLessThan
>
*
recoverMap
=
0
);
void
delaunayizeBDS
(
GFace
*
gf
,
BDS_Mesh
&
m
,
int
&
nb_swap
);
void
delaunayizeBDS
(
GFace
*
gf
,
BDS_Mesh
&
m
,
int
&
nb_swap
);
void
collapseSmallEdges
(
GModel
&
gm
);
void
collapseSmallEdges
(
GModel
&
gm
);
BDS_Mesh
*
gmsh2BDS
(
std
::
list
<
GFace
*>
&
l
);
BDS_Mesh
*
gmsh2BDS
(
std
::
list
<
GFace
*>
&
l
);
...
...
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