Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
C
CGoGN
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
1
Issues
1
List
Boards
Labels
Service Desk
Milestones
Merge Requests
0
Merge Requests
0
Operations
Operations
Incidents
Analytics
Analytics
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
CGoGN
CGoGN
Commits
a8449583
Commit
a8449583
authored
Sep 05, 2011
by
Sylvain Thery
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
bug mergeCloseVertices (pb possible avec petit maillage)
parent
69cbf02a
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
11 additions
and
11 deletions
+11
-11
include/Algo/Import/import2tablesSurface.hpp
include/Algo/Import/import2tablesSurface.hpp
+11
-11
No files found.
include/Algo/Import/import2tablesSurface.hpp
View file @
a8449583
...
...
@@ -1195,24 +1195,24 @@ bool MeshTablesSurface<PFP>::mergeCloseVertices()
newIndices
[
i
]
=
0xffffffff
;
}
// compute EPSILON: average length of 50 of 100 first edges of f
irst faces divide by 10000
int
nb
=
100
;
if
(
m_nbEdges
.
size
()
<
100
)
nb
=
m_nbEdges
.
size
()
;
// compute EPSILON: average length of 50 of 100 first edges of f
aces divide by 10000 (very very closed)
unsigned
int
nbf
=
100
;
if
(
nbf
>
m_nbFaces
)
nb
f
=
m_nbFaces
;
int
k
=
0
;
typename
PFP
::
REAL
d
=
0
;
for
(
int
i
=
0
;
i
<
nb
;
i
+=
2
)
double
d
=
0
;
for
(
unsigned
int
i
=
0
;
i
<
nbf
;
++
i
)
{
typename
PFP
::
VEC3
e1
=
positions
[
m_emb
[
k
+
1
]]
-
positions
[
m_emb
[
k
]];
d
+=
e1
.
norm
(
);
d
+=
double
(
e1
.
norm
()
);
k
+=
m_nbEdges
[
i
];
}
d
/=
float
(
nb
/
2
);
typename
PFP
::
REAL
EPSILON
=
d
/
10000.0
f
;
d
/=
double
(
nbf
);
typename
PFP
::
REAL
EPSILON
=
d
/
10000.0
;
// traverse vertices
for
(
unsigned
int
i
=
positions
.
begin
();
i
!=
positions
.
end
();
positions
.
next
(
i
))
{
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment