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
cb192665
Commit
cb192665
authored
8 years ago
by
Jean-François Remacle
Browse files
Options
Downloads
Patches
Plain Diff
fixed BL orientation
parent
fcfe3916
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
Mesh/meshGFaceOptimize.cpp
+38
-13
38 additions, 13 deletions
Mesh/meshGFaceOptimize.cpp
with
38 additions
and
13 deletions
Mesh/meshGFaceOptimize.cpp
+
38
−
13
View file @
cb192665
...
...
@@ -260,29 +260,54 @@ void transferDataStructure(GFace *gf, std::set<MTri3*, compareTri3Ptr> &AllTris,
// parameter space (it would be nicer to change the actual algorithm
// to ensure that we create correctly-oriented triangles in the
// first place)
// if BL triangles are considered, then all that is WRONG !
if
(
gf
->
triangles
.
size
()
>
1
){
bool
BL
=
!
gf
->
getColumns
()
->
_toFirst
.
empty
();
double
n1
[
3
],
n2
[
3
];
MTriangle
*
t
=
gf
->
triangles
[
0
];
MVertex
*
v0
=
t
->
getVertex
(
0
),
*
v1
=
t
->
getVertex
(
1
),
*
v2
=
t
->
getVertex
(
2
);
int
index0
=
data
.
getIndex
(
v0
);
int
index1
=
data
.
getIndex
(
v1
);
int
index2
=
data
.
getIndex
(
v2
);
normal3points
(
data
.
Us
[
index0
],
data
.
Vs
[
index0
],
0.
,
data
.
Us
[
index1
],
data
.
Vs
[
index1
],
0.
,
data
.
Us
[
index2
],
data
.
Vs
[
index2
],
0.
,
n1
);
if
(
!
BL
){
int
index0
=
data
.
getIndex
(
v0
);
int
index1
=
data
.
getIndex
(
v1
);
int
index2
=
data
.
getIndex
(
v2
);
normal3points
(
data
.
Us
[
index0
],
data
.
Vs
[
index0
],
0.
,
data
.
Us
[
index1
],
data
.
Vs
[
index1
],
0.
,
data
.
Us
[
index2
],
data
.
Vs
[
index2
],
0.
,
n1
);
}
else
{
// BL --> PLANAR FACES !!!
normal3points
(
v0
->
x
(),
v0
->
y
(),
v0
->
z
(),
v1
->
x
(),
v1
->
y
(),
v1
->
z
(),
v2
->
x
(),
v2
->
y
(),
v2
->
z
(),
n1
);
}
for
(
unsigned
int
j
=
1
;
j
<
gf
->
triangles
.
size
();
j
++
){
t
=
gf
->
triangles
[
j
];
v0
=
t
->
getVertex
(
0
);
v1
=
t
->
getVertex
(
1
);
v2
=
t
->
getVertex
(
2
);
index0
=
data
.
getIndex
(
v0
);
index1
=
data
.
getIndex
(
v1
);
index2
=
data
.
getIndex
(
v2
);
normal3points
(
data
.
Us
[
index0
],
data
.
Vs
[
index0
],
0.
,
data
.
Us
[
index1
],
data
.
Vs
[
index1
],
0.
,
data
.
Us
[
index2
],
data
.
Vs
[
index2
],
0.
,
n2
);
if
(
!
BL
){
int
index0
=
data
.
getIndex
(
v0
);
int
index1
=
data
.
getIndex
(
v1
);
int
index2
=
data
.
getIndex
(
v2
);
normal3points
(
data
.
Us
[
index0
],
data
.
Vs
[
index0
],
0.
,
data
.
Us
[
index1
],
data
.
Vs
[
index1
],
0.
,
data
.
Us
[
index2
],
data
.
Vs
[
index2
],
0.
,
n2
);
}
else
{
// BL --> PLANAR FACES !!!
normal3points
(
v0
->
x
(),
v0
->
y
(),
v0
->
z
(),
v1
->
x
(),
v1
->
y
(),
v1
->
z
(),
v2
->
x
(),
v2
->
y
(),
v2
->
z
(),
n2
);
}
double
pp
;
prosca
(
n1
,
n2
,
&
pp
);
// orient the bignou
if
(
pp
<
0
)
t
->
reverse
();
}
}
}
splitEquivalentTriangles
(
gf
,
data
);
computeEquivalences
(
gf
,
data
);
}
...
...
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