rm-archive/PuzzleSolver
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

stash3

Browse Source
This commit is contained in:
g-spacewhale 2018-01-19 16:00:38 +01:00
parent 2d84f7273b
commit 6bfa5b1f7c
1 changed files with 29 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

29
Source/functions/solve/puzzleExtension.cpp
View File

@ -8,6 +8,7 @@ typedef std::vector<std::vector<Point>> Contour_t;
typedef std::vector<Vec4i> Hierarchy_t; //hierarchy object is needed for drawContours apparently typedef std::vector<Vec4i> Hierarchy_t; //hierarchy object is needed for drawContours apparently
Mat crop2ContourInv(const Mat & img); Mat crop2ContourInv(const Mat & img);
Contour_t getLongestContour(Mat bw);
void Puzzle::printPuzzle() void Puzzle::printPuzzle()
{ {
@ -218,3 +219,31 @@ Mat crop2ContourInv(const Mat & img){ // for white background images
// imshow("cropped", cropped); // imshow("cropped", cropped);
return cropped; return cropped;
} }
Contour_t getLongestContour(Mat bw){
Mat mask = Mat::zeros(bw.size(), CV_8UC1);
Hierarchy_t hierarchy;
Contour_t contours;
findContours(bw, contours, hierarchy, CV_RETR_EXTERNAL, CV_CHAIN_APPROX_SIMPLE);
double area = 0;
double largestArea = 0;
size_t largestIndex = 0;
for (size_t i = 0; i < contours.size(); ++i)
{
area = contourArea(contours[i]);
if (area < 1e2 || 1e5 < area) continue; //
if (area > largestArea) {
largestArea = area;
largestIndex = i; // i is type size_t, should be converted to int.
}
}
Contour_t largestContour;
largestContour.resize(contours.size()); //Otherwise it is just a null pointer and the program crashes!
size_t index = 0;
int strength = 2; // distance between the original contour and the approximated contour
approxPolyDP(Mat(contours[largestIndex]), largestContour[index], strength, true);
return(largestContour);
}