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
43fa0e70
Commit
43fa0e70
authored
15 years ago
by
Bastien Gorissen
Browse files
Options
Downloads
Patches
Plain Diff
Updating high order swapping.
parent
21855fae
Branches
Branches containing commit
Tags
Tags containing commit
No related merge requests found
Changes
2
Show whitespace changes
Inline
Side-by-side
Showing
2 changed files
Mesh/highOrderSmoother.cpp
+107
-90
107 additions, 90 deletions
Mesh/highOrderSmoother.cpp
Mesh/qualityMeasures.cpp
+13
-10
13 additions, 10 deletions
Mesh/qualityMeasures.cpp
with
120 additions
and
100 deletions
Mesh/highOrderSmoother.cpp
+
107
−
90
View file @
43fa0e70
...
@@ -443,13 +443,9 @@ void highOrderSmoother::smooth_metric(std::vector<MElement*> & all, GFace *gf)
...
@@ -443,13 +443,9 @@ void highOrderSmoother::smooth_metric(std::vector<MElement*> & all, GFace *gf)
double
minD
;
double
minD
;
getDistordedElements
(
all
,
.6
,
v
,
minD
);
Msg
::
Debug
(
"%d elements / %d distorted min Disto = %g"
,
all
.
size
(),
v
.
size
(),
minD
);
if
(
!
v
.
size
())
return
;
if
(
!
v
.
size
())
return
;
const
int
nbLayers
=
2
;
const
int
nbLayers
=
10
;
//2, originally :)
for
(
int
i
=
0
;
i
<
nbLayers
;
i
++
){
for
(
int
i
=
0
;
i
<
nbLayers
;
i
++
){
addOneLayer
(
all
,
v
,
layer
);
addOneLayer
(
all
,
v
,
layer
);
v
.
insert
(
v
.
end
(),
layer
.
begin
(),
layer
.
end
());
v
.
insert
(
v
.
end
(),
layer
.
begin
(),
layer
.
end
());
...
@@ -570,6 +566,7 @@ double highOrderSmoother::smooth_metric_(std::vector<MElement*> & v,
...
@@ -570,6 +566,7 @@ double highOrderSmoother::smooth_metric_(std::vector<MElement*> & v,
J23K33
.
gemm
(
J23
,
K33
,
1
,
0
);
J23K33
.
gemm
(
J23
,
K33
,
1
,
0
);
K22
.
gemm
(
J23K33
,
J32
,
1
,
0
);
K22
.
gemm
(
J23K33
,
J32
,
1
,
0
);
J23K33
.
mult
(
D3
,
R2
);
J23K33
.
mult
(
D3
,
R2
);
J23K33
.
print
(
"J23K33"
);
for
(
int
j
=
0
;
j
<
n2
;
j
++
){
for
(
int
j
=
0
;
j
<
n2
;
j
++
){
Dof
RDOF
=
El
.
getLocalDofR
(
&
se
,
j
);
Dof
RDOF
=
El
.
getLocalDofR
(
&
se
,
j
);
myAssembler
.
assemble
(
RDOF
,
-
R2
(
j
));
myAssembler
.
assemble
(
RDOF
,
-
R2
(
j
));
...
@@ -617,9 +614,9 @@ void highOrderSmoother::smooth(std::vector<MElement*> &all)
...
@@ -617,9 +614,9 @@ void highOrderSmoother::smooth(std::vector<MElement*> &all)
std
::
vector
<
MElement
*>
layer
,
v
;
std
::
vector
<
MElement
*>
layer
,
v
;
double
minD
;
double
minD
;
getDistordedElements
(
all
,
.5
,
v
,
minD
);
getDistordedElements
(
all
,
0
.5
,
v
,
minD
);
Msg
::
Debug
(
"%d elements / %d distorted min Disto = %g
\n
"
,
Msg
::
Info
(
"%d elements / %d distorted min Disto = %g
\n
"
,
all
.
size
(),
v
.
size
(),
minD
);
all
.
size
(),
v
.
size
(),
minD
);
if
(
!
v
.
size
())
return
;
if
(
!
v
.
size
())
return
;
...
@@ -717,67 +714,74 @@ void highOrderSmoother::smooth_cavity(std::vector<MElement*>& cavity,
...
@@ -717,67 +714,74 @@ void highOrderSmoother::smooth_cavity(std::vector<MElement*>& cavity,
std
::
vector
<
MElement
*>&
old_elems
,
std
::
vector
<
MElement
*>&
old_elems
,
GFace
*
gf
)
{
GFace
*
gf
)
{
printf
(
"Smoothing a cavity..."
);
printf
(
"Smoothing a cavity...
\n
"
);
printf
(
"Old elems : %d and %d
\n
"
,
old_elems
[
0
]
->
getNum
(),
old_elems
[
1
]
->
getNum
());
printf
(
"Cavity elems : %d and %d
\n
"
,
cavity
[
0
]
->
getNum
(),
cavity
[
1
]
->
getNum
());
linearSystemFull
<
double
>
*
lsys
=
new
linearSystemFull
<
double
>
;
#ifdef HAVE_TAUCS
linearSystemCSRTaucs
<
double
>
*
lsys
=
new
linearSystemCSRTaucs
<
double
>
;
printf
(
"Using Taucs
\n
"
);
#else
linearSystemCSRGmm
<
double
>
*
lsys
=
new
linearSystemCSRGmm
<
double
>
;
lsys
->
setNoisy
(
1
);
lsys
->
setGmres
(
1
);
lsys
->
setPrec
(
5.e-8
);
printf
(
"Using Gmm
\n
"
);
#endif
dofManager
<
double
>
myAssembler
(
lsys
);
dofManager
<
double
>
myAssembler
(
lsys
);
elasticityTerm
El
(
0
,
1.0
,
0.333
,
getTag
());
elasticityTerm
El
(
0
,
1.0
,
0.333
,
getTag
());
std
::
vector
<
MElement
*>
layer
,
v
;
std
::
vector
<
MElement
*>
layer
,
v
;
v
.
insert
(
v
.
begin
(),
gf
->
triangles
.
begin
(),
gf
->
triangles
.
end
());
/* Debug only :p */
v
.
insert
(
v
.
begin
(),
gf
->
quadrangles
.
begin
(),
gf
->
quadrangles
.
end
());
//cavity = old_elems;
v
.
insert
(
v
.
end
(),
gf
->
triangles
.
begin
(),
gf
->
triangles
.
end
());
v
.
insert
(
v
.
end
(),
gf
->
quadrangles
.
begin
(),
gf
->
quadrangles
.
end
());
addOneLayer
(
v
,
cavity
,
layer
);
addOneLayer
(
v
,
cavity
,
layer
);
//addOneLayer(v,old_elems,layer);
for
(
unsigned
int
i
=
0
;
i
<
layer
.
size
();
i
++
){
for
(
unsigned
int
i
=
0
;
i
<
layer
.
size
();
i
++
){
bool
skip
=
false
;
if
(
find
(
old_elems
.
begin
(),
old_elems
.
end
(),
layer
[
i
])
==
old_elems
.
end
())
{
for
(
std
::
vector
<
MElement
*>::
iterator
itold
=
old_elems
.
begin
();
printf
(
"In the layer, there is element %d
\n
"
,
layer
[
i
]
->
getNum
());
itold
!=
old_elems
.
end
();
itold
++
)
if
(
*
itold
==
layer
[
i
])
{
skip
=
true
;
break
;
}
if
(
skip
)
continue
;
for
(
int
j
=
0
;
j
<
layer
[
i
]
->
getNumVertices
();
j
++
){
for
(
int
j
=
0
;
j
<
layer
[
i
]
->
getNumVertices
();
j
++
){
MVertex
*
vert
=
layer
[
i
]
->
getVertex
(
j
);
MVertex
*
vert
=
layer
[
i
]
->
getVertex
(
j
);
//printf("i = %d, j = %d \n",i,j);
myAssembler
.
fixVertex
(
vert
,
0
,
getTag
(),
0
);
myAssembler
.
fixVertex
(
vert
,
0
,
getTag
(),
0
);
myAssembler
.
fixVertex
(
vert
,
1
,
getTag
(),
0
);
myAssembler
.
fixVertex
(
vert
,
1
,
getTag
(),
0
);
printf
(
"Fixing vertex %d
\n
"
,
vert
->
getNum
());
}
}
}
}
}
//printf("%d vertices \n", _displ.size());
std
::
set
<
MVertex
*>::
iterator
it
;
std
::
map
<
MVertex
*
,
SVector3
>::
iterator
its
;
std
::
map
<
MVertex
*
,
SVector3
>::
iterator
its
;
std
::
map
<
MVertex
*
,
SVector3
>::
iterator
itpresent
;
std
::
map
<
MVertex
*
,
SVector3
>::
iterator
ittarget
;
//std::map<MVertex*,SVector3> verticesToMove;
std
::
set
<
MVertex
*>
verticesToMove
;
std
::
set
<
MVertex
*>
verticesToMove
;
for
(
unsigned
int
i
=
0
;
i
<
cavity
.
size
();
i
++
){
for
(
unsigned
int
i
=
0
;
i
<
cavity
.
size
();
i
++
){
for
(
int
j
=
0
;
j
<
cavity
[
i
]
->
getNumVertices
();
j
++
){
for
(
int
j
=
0
;
j
<
cavity
[
i
]
->
getNumVertices
();
j
++
){
MVertex
*
vert
=
cavity
[
i
]
->
getVertex
(
j
);
MVertex
*
vert
=
cavity
[
i
]
->
getVertex
(
j
);
//printf("Vertex on dim %d with tag %d\n",vert->onWhat()->dim(),vert->onWhat()->tag());
// printf("%d %d %d v\n", i, j, v[i]->getNumVertices());
its
=
_straightSidedLocation
.
find
(
vert
);
its
=
_straightSidedLocation
.
find
(
vert
);
if
(
its
=
=
_straightSidedLocation
.
end
()){
if
(
its
!
=
_straightSidedLocation
.
end
())
{
//
printf("
Ping\n"
);
printf
(
"
SETTING LOCATIONS for %d
\n
"
,
vert
->
getNum
()
);
_straightSidedLocation
[
vert
]
=
_straightSidedLocation
[
vert
]
=
SVector3
(
vert
->
x
(),
vert
->
y
(),
vert
->
z
());
SVector3
(
vert
->
x
(),
vert
->
y
(),
vert
->
z
());
_targetLocation
[
vert
]
=
_targetLocation
[
vert
]
=
SVector3
(
vert
->
x
(),
vert
->
y
(),
vert
->
z
());
SVector3
(
vert
->
x
(),
vert
->
y
(),
vert
->
z
());
if
(
vert
->
onWhat
()
->
dim
()
<
_dim
){
}
else
{
myAssembler
.
fixVertex
(
vert
,
0
,
getTag
(),
0
);
myAssembler
.
fixVertex
(
vert
,
1
,
getTag
(),
0
);
}
}
else
{
//printf("Pong\n");
vert
->
x
()
=
its
->
second
.
x
();
vert
->
x
()
=
its
->
second
.
x
();
vert
->
y
()
=
its
->
second
.
y
();
vert
->
y
()
=
its
->
second
.
y
();
vert
->
z
()
=
its
->
second
.
z
();
vert
->
z
()
=
its
->
second
.
z
();
if
(
vert
->
onWhat
()
->
dim
()
<
_dim
){
if
(
vert
->
onWhat
()
->
dim
()
<
_dim
){
myAssembler
.
fixVertex
(
vert
,
0
,
getTag
(),
0
);
myAssembler
.
fixVertex
(
vert
,
0
,
getTag
(),
0
);
myAssembler
.
fixVertex
(
vert
,
1
,
getTag
(),
0
);
myAssembler
.
fixVertex
(
vert
,
1
,
getTag
(),
0
);
printf
(
"Fixing vertex %d
\n
"
,
vert
->
getNum
());
}
}
}
}
}
}
...
@@ -786,18 +790,16 @@ void highOrderSmoother::smooth_cavity(std::vector<MElement*>& cavity,
...
@@ -786,18 +790,16 @@ void highOrderSmoother::smooth_cavity(std::vector<MElement*>& cavity,
// number the other DOFs
// number the other DOFs
for
(
unsigned
int
i
=
0
;
i
<
cavity
.
size
();
i
++
){
for
(
unsigned
int
i
=
0
;
i
<
cavity
.
size
();
i
++
){
for
(
int
j
=
0
;
j
<
cavity
[
i
]
->
getNumVertices
();
j
++
){
for
(
int
j
=
0
;
j
<
cavity
[
i
]
->
getNumVertices
();
j
++
){
//printf("Numbering i = %d, j = %d \n",i,j);
//printf("%d vertices FIXED %d NUMBERED\n", myAssembler.sizeOfF()
// , myAssembler.sizeOfR());
MVertex
*
vert
=
cavity
[
i
]
->
getVertex
(
j
);
MVertex
*
vert
=
cavity
[
i
]
->
getVertex
(
j
);
printf
(
"Numbering vertex %d
\n
"
,
vert
->
getNum
());
myAssembler
.
numberVertex
(
vert
,
0
,
getTag
());
myAssembler
.
numberVertex
(
vert
,
0
,
getTag
());
myAssembler
.
numberVertex
(
vert
,
1
,
getTag
());
myAssembler
.
numberVertex
(
vert
,
1
,
getTag
());
verticesToMove
.
insert
(
vert
);
verticesToMove
.
insert
(
vert
);
}
}
}
}
//
Msg::Info("%d vertices FIXED %d NUMBERED\n", myAssembler.sizeOfF()
Msg
::
Info
(
"%d vertices FIXED %d NUMBERED
\n
"
,
myAssembler
.
sizeOfF
()
//
, myAssembler.sizeOfR());
,
myAssembler
.
sizeOfR
());
double
dx0
=
smooth_metric_
(
cavity
,
gf
,
myAssembler
,
verticesToMove
,
El
);
double
dx0
=
smooth_metric_
(
cavity
,
gf
,
myAssembler
,
verticesToMove
,
El
);
double
dx
=
dx0
;
double
dx
=
dx0
;
...
@@ -811,8 +813,6 @@ void highOrderSmoother::smooth_cavity(std::vector<MElement*>& cavity,
...
@@ -811,8 +813,6 @@ void highOrderSmoother::smooth_cavity(std::vector<MElement*>& cavity,
dx
=
dx2
;
dx
=
dx2
;
}
}
std
::
set
<
MVertex
*>::
iterator
it
;
for
(
it
=
verticesToMove
.
begin
();
it
!=
verticesToMove
.
end
();
++
it
){
for
(
it
=
verticesToMove
.
begin
();
it
!=
verticesToMove
.
end
();
++
it
){
SPoint2
param
;
SPoint2
param
;
reparamMeshVertexOnFace
(
*
it
,
gf
,
param
);
reparamMeshVertexOnFace
(
*
it
,
gf
,
param
);
...
@@ -829,8 +829,24 @@ void highOrderSmoother::smooth_cavity(std::vector<MElement*>& cavity,
...
@@ -829,8 +829,24 @@ void highOrderSmoother::smooth_cavity(std::vector<MElement*>& cavity,
(
*
it
)
->
y
()
=
p
.
y
();
(
*
it
)
->
y
()
=
p
.
y
();
(
*
it
)
->
z
()
=
p
.
z
();
(
*
it
)
->
z
()
=
p
.
z
();
}
}
printf
(
" Moving %d to %g %g %g
\n
"
,
(
*
it
)
->
getNum
(),
_targetLocation
[(
*
it
)][
0
],
_targetLocation
[(
*
it
)][
1
],
_targetLocation
[(
*
it
)][
2
]
);
}
/*
if (myAssembler.sizeOfR()) {
for (unsigned int i = 0; i < cavity.size(); i++) {
SElement se(cavity[i]);
El.addToMatrix(myAssembler, &se);
}
}
lsys->systemSolve();
}
for (it = verticesToMove.begin(); it != verticesToMove.end(); ++it){
it->first->x() += myAssembler.getDofValue(it->first, 0, getTag());
it->first->y() += myAssembler.getDofValue(it->first, 1, getTag());
it->first->z() += myAssembler.getDofValue(it->first, 2, getTag());
}
*/
delete
lsys
;
delete
lsys
;
}
}
...
@@ -1100,10 +1116,10 @@ struct swap_triangles_pN
...
@@ -1100,10 +1116,10 @@ struct swap_triangles_pN
reparamMeshEdgeOnFace
(
n3
,
n4
,
gf
,
p3
,
p4
);
reparamMeshEdgeOnFace
(
n3
,
n4
,
gf
,
p3
,
p4
);
s_before
=
surfaceTriangleUV
(
p1
,
p2
,
p4
)
+
surfaceTriangleUV
(
p1
,
p2
,
p3
);
s_before
=
surfaceTriangleUV
(
p1
,
p2
,
p4
)
+
surfaceTriangleUV
(
p1
,
p2
,
p3
);
s_after
=
surfaceTriangleUV
(
p
3
,
p4
,
p
1
)
+
surfaceTriangleUV
(
p3
,
p4
,
p2
);
s_after
=
surfaceTriangleUV
(
p
1
,
p4
,
p
3
)
+
surfaceTriangleUV
(
p3
,
p4
,
p2
);
MTriangle
t3lin
(
n
3
,
n4
,
n
1
);
MTriangle
t3lin
(
n
1
,
n4
,
n
3
);
MTriangle
t4lin
(
n
4
,
n
3
,
n2
);
MTriangle
t4lin
(
n
3
,
n
4
,
n2
);
t3
=
setHighOrder
(
&
t3lin
,
gf
,
edgeVertices
,
faceVertices
,
false
,
t3
=
setHighOrder
(
&
t3lin
,
gf
,
edgeVertices
,
faceVertices
,
false
,
!
t1
->
getNumFaceVertices
(),
!
t1
->
getNumFaceVertices
(),
...
@@ -1286,11 +1302,12 @@ static int swapHighOrderTriangles(GFace *gf,
...
@@ -1286,11 +1302,12 @@ static int swapHighOrderTriangles(GFace *gf,
const
double
qold1
=
shapeMeasure
(
t1
);
const
double
qold1
=
shapeMeasure
(
t1
);
const
double
qold2
=
shapeMeasure
(
t2
);
const
double
qold2
=
shapeMeasure
(
t2
);
if
(
qold1
<
0.
6
||
qold2
<
0.
6
)
if
(
qold1
<
0.
005
||
qold2
<
0.
005
)
pairs
.
insert
(
swap_triangles_pN
(
it
->
first
,
t1
,
t2
,
gf
,
pairs
.
insert
(
swap_triangles_pN
(
it
->
first
,
t1
,
t2
,
gf
,
edgeVertices
,
faceVertices
,
s
));
edgeVertices
,
faceVertices
,
s
));
}
}
}
}
std
::
set
<
swap_triangles_pN
>::
iterator
itp
=
pairs
.
begin
();
std
::
set
<
swap_triangles_pN
>::
iterator
itp
=
pairs
.
begin
();
int
nbSwap
=
0
;
int
nbSwap
=
0
;
...
@@ -1315,6 +1332,7 @@ static int swapHighOrderTriangles(GFace *gf,
...
@@ -1315,6 +1332,7 @@ static int swapHighOrderTriangles(GFace *gf,
itp
->
t2
->
getFaceVertices
(
0
,
v2
);
itp
->
t2
->
getFaceVertices
(
0
,
v2
);
itp
->
t3
->
getFaceVertices
(
0
,
v3
);
itp
->
t3
->
getFaceVertices
(
0
,
v3
);
itp
->
t4
->
getFaceVertices
(
0
,
v4
);
itp
->
t4
->
getFaceVertices
(
0
,
v4
);
std
::
vector
<
MVertex
*>
ve1
(
v1
.
begin
()
+
3
,
v1
.
begin
()
+
3
*
o1
);
std
::
vector
<
MVertex
*>
ve1
(
v1
.
begin
()
+
3
,
v1
.
begin
()
+
3
*
o1
);
std
::
vector
<
MVertex
*>
ve2
(
v2
.
begin
()
+
3
,
v2
.
begin
()
+
3
*
o2
);
std
::
vector
<
MVertex
*>
ve2
(
v2
.
begin
()
+
3
,
v2
.
begin
()
+
3
*
o2
);
std
::
vector
<
MVertex
*>
ve3
(
v3
.
begin
()
+
3
,
v3
.
begin
()
+
3
*
o3
);
std
::
vector
<
MVertex
*>
ve3
(
v3
.
begin
()
+
3
,
v3
.
begin
()
+
3
*
o3
);
...
@@ -1324,77 +1342,76 @@ static int swapHighOrderTriangles(GFace *gf,
...
@@ -1324,77 +1342,76 @@ static int swapHighOrderTriangles(GFace *gf,
std
::
vector
<
MVertex
*>
vf3
(
v3
.
begin
()
+
3
*
o3
,
v3
.
end
());
std
::
vector
<
MVertex
*>
vf3
(
v3
.
begin
()
+
3
*
o3
,
v3
.
end
());
std
::
vector
<
MVertex
*>
vf4
(
v4
.
begin
()
+
3
*
o4
,
v4
.
end
());
std
::
vector
<
MVertex
*>
vf4
(
v4
.
begin
()
+
3
*
o4
,
v4
.
end
());
// for (int ed = 0; ed < 3; ed++) {
printf
(
"========== Diff = %g
\n
"
,
diff
);
// std::vector<MVertex*> v1,v2,v3,v4;
// itp->t1->getEdgeVertices(ed,v1);
// itp->t2->getEdgeVertices(ed,v2);
// itp->t3->getEdgeVertices(ed,v3);
// itp->t4->getEdgeVertices(ed,v4);
// ve1.insert(ve1.end(),v1.begin()+2,v1.end());
// ve2.insert(ve2.end(),v2.begin()+2,v2.end());
// ve3.insert(ve3.end(),v3.begin()+2,v3.end());
// ve4.insert(ve4.end(),v4.begin()+2,v4.end());
// }
bool
t1_rem
=
(
t_removed
.
find
(
itp
->
t1
)
!=
t_removed
.
end
());
bool
t2_rem
=
(
t_removed
.
find
(
itp
->
t2
)
!=
t_removed
.
end
());
if
(
t_removed
.
find
(
itp
->
t1
)
==
t_removed
.
end
()
&&
if
(
t1_rem
)
t_removed
.
find
(
itp
->
t2
)
==
t_removed
.
end
()
&&
printf
(
"====== Eww, t1 is going DOWN!
\n
"
);
itp
->
quality_new
>
itp
->
quality_old
&&
if
(
t2_rem
)
printf
(
"====== Eww, t2 is going DOWN!
\n
"
);
if
(
!
t1_rem
&&
!
t2_rem
&&
//itp->quality_new > itp->quality_old &&
diff
<
1.e-9
){
diff
<
1.e-9
){
// itp->print();
printf
(
"quality was %f, is now %f
\n
"
,
itp
->
quality_old
,
itp
->
quality_new
);
printf
(
"Element quality : %f --> %f
\n
"
,
itp
->
quality_old
,
itp
->
quality_new
);
t_removed
.
insert
(
itp
->
t1
);
t_removed
.
insert
(
itp
->
t1
);
t_removed
.
insert
(
itp
->
t2
);
t_removed
.
insert
(
itp
->
t2
);
triangles2
.
push_back
(
itp
->
t3
);
triangles2
.
push_back
(
itp
->
t4
);
v_removed
.
insert
(
vf1
.
begin
(),
vf1
.
end
());
v_removed
.
insert
(
vf1
.
begin
(),
vf1
.
end
());
v_removed
.
insert
(
vf2
.
begin
(),
vf2
.
end
());
v_removed
.
insert
(
vf2
.
begin
(),
vf2
.
end
());
triangles2
.
push_back
(
itp
->
t3
);
triangles2
.
push_back
(
itp
->
t4
);
mesh_vertices2
.
insert
(
mesh_vertices2
.
end
(),
vf3
.
begin
(),
vf3
.
end
());
mesh_vertices2
.
insert
(
mesh_vertices2
.
end
(),
vf3
.
begin
(),
vf3
.
end
());
mesh_vertices2
.
insert
(
mesh_vertices2
.
end
(),
vf4
.
begin
(),
vf4
.
end
());
mesh_vertices2
.
insert
(
mesh_vertices2
.
end
(),
vf4
.
begin
(),
vf4
.
end
());
for
(
std
::
vector
<
MVertex
*>::
iterator
vit
=
ve1
.
begin
();
vit
!=
ve1
.
end
();
vit
++
)
{
for
(
std
::
vector
<
MVertex
*>::
iterator
vit
=
ve1
.
begin
();
vit
!=
ve1
.
end
();
vit
++
)
{
if
(
find
(
ve2
.
begin
(),
ve2
.
begin
(),
*
vit
)
!=
ve2
.
end
())
if
(
find
(
ve2
.
begin
(),
ve2
.
end
(),
*
vit
)
!=
ve2
.
end
())
v_removed
.
insert
(
*
vit
);
v_removed
.
insert
(
*
vit
);
}
}
for
(
std
::
vector
<
MVertex
*>::
iterator
vit
=
ve3
.
begin
();
vit
!=
ve3
.
end
();
vit
++
)
{
for
(
std
::
vector
<
MVertex
*>::
iterator
vit
=
ve3
.
begin
();
vit
!=
ve3
.
end
();
vit
++
)
{
if
(
find
(
ve4
.
begin
(),
ve4
.
end
(),
*
vit
)
!=
ve4
.
end
())
//
if (find(ve4.begin(),ve4.end(),*vit)!=ve4.end())
mesh_vertices2
.
push_back
(
*
vit
);
//
mesh_vertices2.push_back(*vit);
}
}
// if (itp->n34 != itp->n12){
// v_removed.insert(itp->n12);
// mesh_vertices2.push_back(itp->n34);
// }
nbSwap
++
;
nbSwap
++
;
}
}
else
{
else
{
if
(
!
t1_rem
||
!
t2_rem
)
{
for
(
std
::
vector
<
MVertex
*>::
iterator
vit
=
ve1
.
begin
();
vit
!=
ve1
.
end
();
vit
++
)
{
for
(
std
::
vector
<
MVertex
*>::
iterator
vit
=
ve1
.
begin
();
vit
!=
ve1
.
end
();
vit
++
)
{
if
(
find
(
ve2
.
begin
(),
ve2
.
end
(),
*
vit
)
!=
ve2
.
end
())
//if (find(ve2.begin(),ve2.end(),*vit)!=ve2.end())
mesh_vertices2
.
push_back
(
*
vit
);
//mesh_vertices2.push_back(*vit);
}
}
}
for
(
std
::
vector
<
MVertex
*>::
iterator
vit
=
ve3
.
begin
();
vit
!=
ve3
.
end
();
vit
++
)
{
for
(
std
::
vector
<
MVertex
*>::
iterator
vit
=
ve3
.
begin
();
vit
!=
ve3
.
end
();
vit
++
)
{
if
(
find
(
ve4
.
begin
(),
ve4
.
end
(),
*
vit
)
!=
ve4
.
end
())
if
(
find
(
ve4
.
begin
(),
ve4
.
end
(),
*
vit
)
!=
ve4
.
end
())
v_removed
.
insert
(
*
vit
);
v_removed
.
insert
(
*
vit
);
}
}
delete
itp
->
t3
;
delete
itp
->
t3
;
delete
itp
->
t4
;
delete
itp
->
t4
;
// if (itp->n34 != itp->n12) delete itp->n34;
}
}
++
itp
;
++
itp
;
}
}
int
c1
=
0
,
c2
=
0
;
int
c1
=
0
,
c2
=
0
;
for
(
unsigned
int
i
=
0
;
i
<
gf
->
mesh_vertices
.
size
();
i
++
){
for
(
unsigned
int
i
=
0
;
i
<
gf
->
mesh_vertices
.
size
();
i
++
){
if
(
v_removed
.
find
(
gf
->
mesh_vertices
[
i
])
==
v_removed
.
end
()){
if
(
v_removed
.
find
(
gf
->
mesh_vertices
[
i
])
==
v_removed
.
end
()){
//
mesh_vertices2.push_back(gf->mesh_vertices[i]);
mesh_vertices2
.
push_back
(
gf
->
mesh_vertices
[
i
]);
c1
++
;
c1
++
;
}
}
else
{
else
{
delete
gf
->
mesh_vertices
[
i
];
//mesh_vertices2.push_back(gf->mesh_vertices[i]);
//delete gf->mesh_vertices[i];
c2
++
;
c2
++
;
}
}
}
}
printf
(
"Deleted %d (%d) vertices from %d
\n
"
,
c2
,
v_removed
.
size
(),
gf
->
mesh_vertices
.
size
());
gf
->
mesh_vertices
=
mesh_vertices2
;
gf
->
mesh_vertices
=
mesh_vertices2
;
printf
(
"Deleted %d vertices from %d
\n
"
,
c2
,
(
int
)
gf
->
mesh_vertices
.
size
());
printf
(
"Deleted %d vertices from %d
\n
"
,
c2
,
(
int
)
gf
->
mesh_vertices
.
size
());
printf
(
"Added %d vertices
\n
"
,
c1
);
printf
(
"Added %d vertices
\n
"
,
c1
);
...
@@ -1408,7 +1425,7 @@ static int swapHighOrderTriangles(GFace *gf,
...
@@ -1408,7 +1425,7 @@ static int swapHighOrderTriangles(GFace *gf,
}
}
}
}
printf
(
"replacing %d by %d
\n
"
,
(
int
)
gf
->
triangles
.
size
(),
(
int
)
triangles2
.
size
());
printf
(
"replacing
triangles
%d by %d
\n
"
,
gf
->
triangles
.
size
(),
triangles2
.
size
());
gf
->
triangles
=
triangles2
;
gf
->
triangles
=
triangles2
;
return
nbSwap
;
return
nbSwap
;
}
}
...
...
This diff is collapsed.
Click to expand it.
Mesh/qualityMeasures.cpp
+
13
−
10
View file @
43fa0e70
...
@@ -327,11 +327,11 @@ double qmDistorsionOfMapping(MTetrahedron *e)
...
@@ -327,11 +327,11 @@ double qmDistorsionOfMapping(MTetrahedron *e)
}
}
double
qmTriangleAngles
(
MTriangle
*
e
)
{
double
qmTriangleAngles
(
MTriangle
*
e
)
{
double
a
=
1
00
;
double
a
=
5
00
;
double
worst_quality
=
std
::
numeric_limits
<
double
>::
max
();
double
worst_quality
=
std
::
numeric_limits
<
double
>::
max
();
double
mat
[
3
][
3
];
double
mat
[
3
][
3
];
double
mat2
[
3
][
3
];
double
mat2
[
3
][
3
];
double
den
=
atan
(
a
*
(
M_PI
/
9
))
+
atan
(
a
*
(
2
*
M_PI
/
9
-
(
M_PI
/
9
)
));
double
den
=
atan
(
a
*
(
M_PI
/
9
))
+
atan
(
a
*
(
M_PI
/
9
));
// This matrix is used to "rotate" the triangle to get each vertex
// This matrix is used to "rotate" the triangle to get each vertex
// as the "origin" of the mapping in turn
// as the "origin" of the mapping in turn
...
@@ -368,17 +368,19 @@ double qmTriangleAngles (MTriangle *e) {
...
@@ -368,17 +368,19 @@ double qmTriangleAngles (MTriangle *e) {
double
orientation
;
double
orientation
;
prosca
(
v12
,
v34
,
&
orientation
);
prosca
(
v12
,
v34
,
&
orientation
);
// If the
if the
triangle is "flipped" it's no good
// If the triangle is "flipped" it's no good
if
(
orientation
<
0
)
if
(
orientation
<
0
)
return
-
std
::
numeric_limits
<
double
>::
max
();
return
-
std
::
numeric_limits
<
double
>::
max
();
double
c
;
double
c
;
prosca
(
v1
,
v2
,
&
c
);
prosca
(
v1
,
v2
,
&
c
);
double
x
=
acos
(
c
)
-
M_PI
/
3
;
double
x
=
acos
(
c
)
-
M_PI
/
3
;
double
quality
=
(
atan
(
a
*
(
x
+
M_PI
/
9
))
+
atan
(
a
*
(
2
*
M_PI
/
9
-
(
x
+
M_PI
/
9
))))
/
den
;
printf
(
"Angle %g "
,
(
x
+
M_PI
/
3
)
/
M_PI
*
180
);
double
quality
=
(
atan
(
a
*
(
x
+
M_PI
/
9
))
+
atan
(
a
*
(
M_PI
/
9
-
x
)))
/
den
;
printf
(
"Quality %g
\n
"
,
quality
);
worst_quality
=
std
::
min
(
worst_quality
,
quality
);
worst_quality
=
std
::
min
(
worst_quality
,
quality
);
}
}
//printf("\n");
return
worst_quality
;
return
worst_quality
;
}
}
...
@@ -409,6 +411,7 @@ double qmQuadrangleAngles (MQuadrangle *e) {
...
@@ -409,6 +411,7 @@ double qmQuadrangleAngles (MQuadrangle *e) {
// matmat(rot,mat,tmp);
// matmat(rot,mat,tmp);
// memcpy(mat, tmp, sizeof(mat));
// memcpy(mat, tmp, sizeof(mat));
//}
//}
//get angle
//get angle
double
v1
[
3
]
=
{
mat
[
0
][
0
],
mat
[
0
][
1
],
mat
[
0
][
2
]
};
double
v1
[
3
]
=
{
mat
[
0
][
0
],
mat
[
0
][
1
],
mat
[
0
][
2
]
};
double
v2
[
3
]
=
{
mat
[
1
][
0
],
mat
[
1
][
1
],
mat
[
1
][
2
]
};
double
v2
[
3
]
=
{
mat
[
1
][
0
],
mat
[
1
][
1
],
mat
[
1
][
2
]
};
...
@@ -432,7 +435,7 @@ double qmQuadrangleAngles (MQuadrangle *e) {
...
@@ -432,7 +435,7 @@ double qmQuadrangleAngles (MQuadrangle *e) {
double
c
;
double
c
;
prosca
(
v1
,
v2
,
&
c
);
prosca
(
v1
,
v2
,
&
c
);
printf
(
"%g %g
\n
"
,
c
,
acos
(
c
)
*
180
/
M_PI
);
printf
(
"
Youhou
%g %g
\n
"
,
c
,
acos
(
c
)
*
180
/
M_PI
);
double
x
=
fabs
(
acos
(
c
))
-
M_PI
/
2
;
double
x
=
fabs
(
acos
(
c
))
-
M_PI
/
2
;
double
quality
=
(
atan
(
a
*
(
x
+
M_PI
/
4
))
+
atan
(
a
*
(
2
*
M_PI
/
4
-
(
x
+
M_PI
/
4
))))
/
den
;
double
quality
=
(
atan
(
a
*
(
x
+
M_PI
/
4
))
+
atan
(
a
*
(
2
*
M_PI
/
4
-
(
x
+
M_PI
/
4
))))
/
den
;
worst_quality
=
std
::
min
(
worst_quality
,
quality
);
worst_quality
=
std
::
min
(
worst_quality
,
quality
);
...
...
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