Skip to content
Projects
Groups
Snippets
Help
Loading...
Sign in / Register
Toggle navigation
O
opencv_contrib
Project
Project
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Packages
Packages
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
submodule
opencv_contrib
Commits
8a05bdbc
Commit
8a05bdbc
authored
Jun 24, 2015
by
Maksim Shabunin
Browse files
Options
Browse Files
Download
Plain Diff
Merge pull request #134 from PhilLab/patch-2
SurfaceMatching: OpenMP indices
parents
91bb20da
1d7f80b0
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
2 additions
and
2 deletions
+2
-2
ppf_match_3d.cpp
modules/surface_matching/src/ppf_match_3d.cpp
+2
-2
No files found.
modules/surface_matching/src/ppf_match_3d.cpp
View file @
8a05bdbc
...
...
@@ -375,7 +375,7 @@ void PPF3DDetector::clusterPoses(std::vector<Pose3DPtr> poseList, int numPoses,
#pragma omp parallel for
#endif
// uses weighting by the number of votes
for
(
size_t
i
=
0
;
i
<
poseClusters
.
size
(
);
i
++
)
for
(
int
i
=
0
;
i
<
static_cast
<
int
>
(
poseClusters
.
size
()
);
i
++
)
{
// We could only average the quaternions. So I will make use of them here
double
qAvg
[
4
]
=
{
0
},
tAvg
[
3
]
=
{
0
};
...
...
@@ -426,7 +426,7 @@ void PPF3DDetector::clusterPoses(std::vector<Pose3DPtr> poseList, int numPoses,
#if defined _OPENMP
#pragma omp parallel for
#endif
for
(
size_t
i
=
0
;
i
<
poseClusters
.
size
(
);
i
++
)
for
(
int
i
=
0
;
i
<
static_cast
<
int
>
(
poseClusters
.
size
()
);
i
++
)
{
// We could only average the quaternions. So I will make use of them here
double
qAvg
[
4
]
=
{
0
},
tAvg
[
3
]
=
{
0
};
...
...
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