Ask Your Question

Fill an image with the content of RotatedRect

asked 2013-06-07 01:22:42 -0500

yes123 gravatar image

updated 2013-06-07 01:45:19 -0500

I have:

   Mat myImage;

I would like to fill with black the rotated rectangle inside myImage.

Any fast/elegant way to do it?
Note: I would avoid to rotate the image just to fill that rotatedRect

edit retag flag offensive close merge delete

3 answers

Sort by ยป oldest newest most voted

answered 2013-06-07 02:43:32 -0500

Ben gravatar image

You can take the rotated rectangle's edges and use fillConvexPoly()

edit flag offensive delete link more


Thanks to Ben for the nice answer! So you should only compute fillConvexPoly(myImage, rRect.points(vertices), 4, Scalar(0));

Mahdi gravatar imageMahdi ( 2013-06-07 03:07:49 -0500 )edit

answered 2013-10-07 14:54:38 -0500

ahundt gravatar image

fillConvexPoly() seems like the right solution. Here is the version I wrote based on Ben's answer:

 // default color is white
inline void drawRotatedRect(cv::Mat& image, cv::RotatedRect rRect, cv::Scalar color = cv::Scalar(255.0, 255.0, 255.0) ) {

   cv::Point2f vertices2f[4];
   cv::Point vertices[4];
   for(int i = 0; i < 4; ++i){
     vertices[i] = vertices2f[i];

// default color is white
inline void drawRectangle(cv::Mat& image, cv::Point center, cv::Size rectSizePixels, double rotDeg, cv::Scalar color = cv::Scalar(255.0, 255.0, 255.0) ) {

   cv::RotatedRect rRect(center, rectSizePixels, rotDeg); // opencv expects degrees

edit flag offensive delete link more

answered 2013-06-07 02:53:11 -0500

Mahdi gravatar image

updated 2013-06-07 02:55:31 -0500

Here is an answer to this: The idea is to check whether every pixel is in the region respect to rectangle edges:

for(int i=0; i<myImage.rows; ++i)
    for(int j=0; j<myImage.cols; ++j)
        if(isInRotatedRect( Point(j,i), rotated_rect))
  <uchar>(i,j) = 0;

for computing isInRotatedRect:

bool isInRotatedRect(Point p, RotatedRect rRect)
    double line_pro[4];
    Point2f vertices[4];
    for(int i=0; i<4; ++i)
        line_pro[i] = computeProduct(p, vertices[i], vertices[(i+1)%4]);
    if(line_pro[1]*line_pro[3]<0 && line_pro[0]*line_pro[2]<0)
        return true;
    return false;

//finding whether  point p is at the left or right side of rectangle edge ab.  
double computeProduct(Point p, Point2f a, Point2f b)
    double m = (a.y-b.y) / (a.x-b.x);
    double c = a.y - k * a.x;
    return m * p.x - p.y + c;

A better and more intuitive way would be rather than doing this for every image make a zero one mask and the cross product original image! This may be more efficient specially in video.

edit flag offensive delete link more


-1. This is a naive brute-force solution unable to generalize (i.e. different line widths and styles) and simply too complicated and therefore slow.

SR gravatar imageSR ( 2013-06-08 20:15:49 -0500 )edit
Login/Signup to Answer

Question Tools


Asked: 2013-06-07 01:22:42 -0500

Seen: 8,663 times

Last updated: Oct 07 '13