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
505b9ec6
Commit
505b9ec6
authored
16 years ago
by
Laurent Van Migroet
Browse files
Options
Downloads
Patches
Plain Diff
compareTri3Ptr inline bool operator () ... const
parent
3f105b4c
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/meshGFaceDelaunayInsertion.h
+11
-11
11 additions, 11 deletions
Mesh/meshGFaceDelaunayInsertion.h
with
11 additions
and
11 deletions
Mesh/meshGFaceDelaunayInsertion.h
+
11
−
11
View file @
505b9ec6
...
...
@@ -17,7 +17,7 @@
// along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
// USA.
//
//
// Please report all bugs and problems to <gmsh@geuz.org>.
#include
"MElement.h"
...
...
@@ -31,17 +31,17 @@ class BDS_Mesh;
class
BDS_Point
;
void
buildMetric
(
GFace
*
gf
,
double
*
uv
,
double
*
metric
);
int
inCircumCircleAniso
(
GFace
*
gf
,
double
*
p1
,
double
*
p2
,
double
*
p3
,
double
*
p4
,
int
inCircumCircleAniso
(
GFace
*
gf
,
double
*
p1
,
double
*
p2
,
double
*
p3
,
double
*
p4
,
double
*
metric
);
int
inCircumCircleAniso
(
GFace
*
gf
,
MTriangle
*
base
,
const
double
*
uv
,
const
double
*
metric
,
const
std
::
vector
<
double
>
&
Us
,
const
std
::
vector
<
double
>
&
Vs
);
const
std
::
vector
<
double
>
&
Us
,
const
std
::
vector
<
double
>
&
Vs
);
void
circumCenterXYZ
(
double
*
p1
,
double
*
p2
,
double
*
p3
,
double
*
res
,
double
*
uv
=
0
);
void
circumCenterMetric
(
MTriangle
*
base
,
void
circumCenterMetric
(
MTriangle
*
base
,
const
double
*
metric
,
const
std
::
vector
<
double
>
&
Us
,
const
std
::
vector
<
double
>
&
Vs
,
double
*
x
,
double
&
Radius2
);
bool
circumCenterMetricInTriangle
(
MTriangle
*
base
,
bool
circumCenterMetricInTriangle
(
MTriangle
*
base
,
const
double
*
metric
,
const
std
::
vector
<
double
>
&
Us
,
const
std
::
vector
<
double
>
&
Vs
);
...
...
@@ -60,13 +60,13 @@ class MTri3
bool
isDeleted
()
const
{
return
deleted
;
}
void
forceRadius
(
double
r
){
circum_radius
=
r
;
}
double
getRadius
()
const
{
return
circum_radius
;
}
MTri3
(
MTriangle
*
t
,
double
lc
);
inline
MTriangle
*
tri
()
const
{
return
base
;
}
inline
void
setNeigh
(
int
iN
,
MTri3
*
n
)
{
neigh
[
iN
]
=
n
;
}
inline
MTri3
*
getNeigh
(
int
iN
)
const
{
return
neigh
[
iN
];
}
int
inCircumCircle
(
const
double
*
p
)
const
;
inline
int
inCircumCircle
(
double
x
,
double
y
)
const
int
inCircumCircle
(
const
double
*
p
)
const
;
inline
int
inCircumCircle
(
double
x
,
double
y
)
const
{
const
double
p
[
2
]
=
{
x
,
y
};
return
inCircumCircle
(
p
);
...
...
@@ -76,7 +76,7 @@ class MTri3
return
inCircumCircle
(
v
->
x
(),
v
->
y
());
}
inline
void
setDeleted
(
bool
d
){
deleted
=
d
;
}
inline
bool
assertNeigh
()
const
inline
bool
assertNeigh
()
const
{
if
(
deleted
)
return
true
;
for
(
int
i
=
0
;
i
<
3
;
i
++
)
...
...
@@ -94,8 +94,8 @@ class MTri3
class
compareTri3Ptr
{
public:
inline
bool
operator
()
(
const
MTri3
*
a
,
const
MTri3
*
b
)
{
inline
bool
operator
()
(
const
MTri3
*
a
,
const
MTri3
*
b
)
const
{
if
(
a
->
getRadius
()
>
b
->
getRadius
())
return
true
;
if
(
a
->
getRadius
()
<
b
->
getRadius
())
return
false
;
return
a
<
b
;
...
...
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