Skip to content
Projects
Groups
Snippets
Help
Loading...
Sign in / Register
Toggle navigation
O
opencv
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
Commits
8283ddb5
Commit
8283ddb5
authored
Sep 21, 2016
by
Francisco Facioni
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
LSD: Use a fixed size array instead of using std::vector
parent
de9c0d99
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
2 additions
and
2 deletions
+2
-2
lsd.cpp
modules/imgproc/src/lsd.cpp
+2
-2
No files found.
modules/imgproc/src/lsd.cpp
View file @
8283ddb5
...
...
@@ -964,7 +964,7 @@ double LineSegmentDetectorImpl::rect_nfa(const rect& rec) const
double
dyhw
=
rec
.
dy
*
half_width
;
double
dxhw
=
rec
.
dx
*
half_width
;
std
::
vector
<
edge
>
ordered_x
(
4
)
;
edge
ordered_x
[
4
]
;
edge
*
min_y
=
&
ordered_x
[
0
];
edge
*
max_y
=
&
ordered_x
[
0
];
// Will be used for loop range
...
...
@@ -973,7 +973,7 @@ double LineSegmentDetectorImpl::rect_nfa(const rect& rec) const
ordered_x
[
2
].
p
.
x
=
int
(
rec
.
x2
+
dyhw
);
ordered_x
[
2
].
p
.
y
=
int
(
rec
.
y2
-
dxhw
);
ordered_x
[
2
].
taken
=
false
;
ordered_x
[
3
].
p
.
x
=
int
(
rec
.
x1
+
dyhw
);
ordered_x
[
3
].
p
.
y
=
int
(
rec
.
y1
-
dxhw
);
ordered_x
[
3
].
taken
=
false
;
std
::
sort
(
ordered_x
.
begin
(),
ordered_x
.
end
()
,
AsmallerB_XoverY
);
std
::
sort
(
ordered_x
,
ordered_x
+
4
,
AsmallerB_XoverY
);
// Find min y. And mark as taken. find max y.
for
(
unsigned
int
i
=
1
;
i
<
4
;
++
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