lines.cpp 1.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263
  1. #include<opencv2/opencv.hpp>
  2. int main(int argc, char *argv[])
  3. {
  4. cv::Mat img=cv::imread("files/masckera.png",CV_LOAD_IMAGE_GRAYSCALE);
  5. std::vector< std::vector<cv::Point> > contours;
  6. std::vector<cv::Vec4i> hierarchy;
  7. cv::findContours(img,contours,hierarchy,CV_RETR_EXTERNAL,CV_CHAIN_APPROX_SIMPLE);
  8. cv::drawContours(img,contours,-1,cv::Scalar(255,255,255),5);
  9. if( 1!=contours.size() )
  10. {
  11. std::cout << "non ci piace" << std::endl;
  12. return -1;
  13. }
  14. std::vector<cv::Point> hull;
  15. cv::convexHull(cv::Mat(contours[0]),hull,false);
  16. int i;
  17. int idx[4]={0};
  18. int distance[2]={0};
  19. for( i=0; hull.size()>i; i++ )
  20. {
  21. cv::Point one=hull[i];
  22. cv::Point two=hull[(i+1)%hull.size()];
  23. int d=pow(one.x-two.x,2)+pow(one.y-two.y,2);
  24. if( d>distance[0] )
  25. {
  26. idx[1]=idx[0];
  27. idx[3]=(idx[1]+1)%hull.size();
  28. idx[0]=i;
  29. idx[2]=(idx[0]+1)%hull.size();
  30. distance[1]=distance[0];
  31. distance[0]=d;
  32. }
  33. else if( d>distance[1] )
  34. {
  35. idx[1]=i;
  36. idx[3]=(i+1)%hull.size();
  37. distance[1]=d;
  38. }
  39. }
  40. cv::circle(img,hull[idx[0]],30,255,-1);
  41. cv::circle(img,hull[(idx[0]+1)%hull.size()],30,255,-1);
  42. cv::circle(img,hull[idx[1]],20,255,-1);
  43. cv::circle(img,hull[(idx[1]+1)%hull.size()],20,255,-1);
  44. std::cout << hull.size() << ", " << contours[0].size() << std::endl;
  45. std::cout
  46. << "(" << idx[0] << "," << distance[0] << ") -- "
  47. << "(" << idx[1] << "," << distance[1] << ")" << std::endl;
  48. cv::namedWindow("test",CV_WINDOW_NORMAL);
  49. cv::imshow("test",img);
  50. cv::waitKey(0);
  51. return 0;
  52. }