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
c27e8777
Commit
c27e8777
authored
17 years ago
by
Jean-François Remacle
Browse files
Options
Downloads
Patches
Plain Diff
*** empty log message ***
parent
0628eba0
Branches
Branches containing commit
Tags
Tags containing commit
No related merge requests found
Changes
3
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
Mesh/BDS.cpp
+9
-4
9 additions, 4 deletions
Mesh/BDS.cpp
Mesh/meshGFace.cpp
+1
-22
1 addition, 22 deletions
Mesh/meshGFace.cpp
Mesh/meshGFaceOptimize.cpp
+1
-3
1 addition, 3 deletions
Mesh/meshGFaceOptimize.cpp
with
11 additions
and
29 deletions
Mesh/BDS.cpp
+
9
−
4
View file @
c27e8777
// $Id: BDS.cpp,v 1.7
8
2007-0
9
-10
04:47:03 geuzain
e Exp $
// $Id: BDS.cpp,v 1.7
9
2007-
1
0-10
13:59:30 remacl
e Exp $
//
// Copyright (C) 1997-2007 C. Geuzaine, J.-F. Remacle
//
...
...
@@ -236,7 +236,11 @@ BDS_Edge *BDS_Mesh::recover_edge(int num1, int num2,std::set<EdgeToRecover> *e2r
{
if
(
e2r
&&
e2r
->
find
(
EdgeToRecover
(
e
->
p1
->
iD
,
e
->
p2
->
iD
,
0
))
!=
e2r
->
end
())
{
Msg
(
GERROR
,
" edge %d %d cannot be recovered because it intersects %d %d"
,
num1
,
num2
,
e
->
p1
->
iD
,
e
->
p2
->
iD
);
std
::
set
<
EdgeToRecover
>::
iterator
itr1
=
e2r
->
find
(
EdgeToRecover
(
e
->
p1
->
iD
,
e
->
p2
->
iD
,
0
));
std
::
set
<
EdgeToRecover
>::
iterator
itr2
=
e2r
->
find
(
EdgeToRecover
(
num1
,
num2
,
0
));
Msg
(
GERROR
,
" edge %d %d on model edge %d cannot be recovered because it intersects %d %d on model edge %d"
,
num1
,
num2
,
itr2
->
ge
->
tag
(),
e
->
p1
->
iD
,
e
->
p2
->
iD
,
itr1
->
ge
->
tag
());
return
false
;
}
intersected
.
push_back
(
e
);
...
...
@@ -1150,8 +1154,9 @@ void BDS_Mesh::recombineIntoQuads (const double angle_limit, GFace *gf)
smooth_point_parametric
(
*
itpt
,
gf
);
++
itpt
;
}
}
}
void
FullQuadMesh
()
{
}
This diff is collapsed.
Click to expand it.
Mesh/meshGFace.cpp
+
1
−
22
View file @
c27e8777
// $Id: meshGFace.cpp,v 1.9
0
2007-10-10
08:4
9:3
4
remacle Exp $
// $Id: meshGFace.cpp,v 1.9
1
2007-10-10
13:5
9:3
0
remacle Exp $
//
// Copyright (C) 1997-2007 C. Geuzaine, J.-F. Remacle
//
...
...
@@ -401,27 +401,6 @@ void RefineMesh ( GFace *gf, BDS_Mesh &m , const int NIT)
int
MAXNP
=
m
.
MAXPOINTNUMBER
;
// computecharacteristic lengths using 1D mesh edge spacing
// those lengths will propagate in the 2D mesh.
if
(
0
&&
NIT
>
0
)
{
std
::
set
<
BDS_Point
*
,
PointLessThan
>::
iterator
itp
=
m
.
points
.
begin
();
while
(
itp
!=
m
.
points
.
end
())
{
std
::
list
<
BDS_Edge
*>::
iterator
it
=
(
*
itp
)
->
edges
.
begin
();
std
::
list
<
BDS_Edge
*>::
iterator
ite
=
(
*
itp
)
->
edges
.
end
();
double
L
=
1.e22
;
while
(
it
!=
ite
){
double
l
=
(
*
it
)
->
length
();
if
(
l
<
L
&&
(
*
it
)
->
g
&&
(
*
it
)
->
g
->
classif_degree
==
1
)
L
=
l
;
++
it
;
}
(
*
itp
)
->
lc
()
=
L
;
(
*
itp
)
->
lcBGM
()
=
L
;
++
itp
;
}
}
double
OLDminL
=
1.E22
,
OLDmaxL
=
0
;
double
t_spl
=
0
,
t_sw
=
0
,
t_col
=
0
,
t_sm
=
0
;
...
...
This diff is collapsed.
Click to expand it.
Mesh/meshGFaceOptimize.cpp
+
1
−
3
View file @
c27e8777
...
...
@@ -188,10 +188,8 @@ void edgeSwappingLawson (GFace *gf)
e2t_cont
::
iterator
it
=
adj
.
begin
();
while
(
it
!=
adj
.
end
())
{
{
bool
evalSwapLawson
=
edgeSwapTestDelaunay
(
it
,
gf
);
if
(
evalSwapLawson
)
{
edgeSwap
(
adj
,
it
,
gf
);
...
...
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