Commit 357e5d55 authored by Nghia Ho's avatar Nghia Ho

Removed trailing whitespaces

parent e6a9c22b
...@@ -685,7 +685,7 @@ rotatedRectangleIntersection ...@@ -685,7 +685,7 @@ rotatedRectangleIntersection
Finds out if there is any intersection between two rotated rectangles. If there is then the vertices of the interesecting region are returned as well. Finds out if there is any intersection between two rotated rectangles. If there is then the vertices of the interesecting region are returned as well.
.. ocv:function:: int rotatedRectangleIntersection( const RotatedRect& rect1, const RotatedRect& rect2, OutputArray intersectingRegion ) .. ocv:function:: int rotatedRectangleIntersection( const RotatedRect& rect1, const RotatedRect& rect2, OutputArray intersectingRegion )
.. ocv:pyfunction:: cv2.rotatedRectangleIntersection( rect1, rect2 ) -> retval, intersectingRegion .. ocv:pyfunction:: cv2.rotatedRectangleIntersection( rect1, rect2 ) -> retval, intersectingRegion
:param rect1: First rectangle :param rect1: First rectangle
...@@ -699,7 +699,7 @@ The following values are returned by the function: ...@@ -699,7 +699,7 @@ The following values are returned by the function:
* INTERSECT_NONE=0 - No intersection * INTERSECT_NONE=0 - No intersection
* INTERSECT_PARTIAL=1 - There is a partial intersection * INTERSECT_PARTIAL=1 - There is a partial intersection
* INTERSECT_FULL=2 - One of the rectangle is fully enclosed in the other * INTERSECT_FULL=2 - One of the rectangle is fully enclosed in the other
......
...@@ -115,7 +115,7 @@ void CV_RotatedRectangleIntersectionTest::test1() ...@@ -115,7 +115,7 @@ void CV_RotatedRectangleIntersectionTest::test1()
vector<Point2f> vertices; vector<Point2f> vertices;
int ret = rotatedRectangleIntersection(rect1, rect2, vertices); int ret = rotatedRectangleIntersection(rect1, rect2, vertices);
CV_Assert(ret == INTERSECT_NONE); CV_Assert(ret == INTERSECT_NONE);
CV_Assert(vertices.empty()); CV_Assert(vertices.empty());
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment