*O(N logN)* complexity in the current implementation. See the OpenCV sample ``convexhull.cpp`` that demonstrates the usage of different function variants.
-ConvexityDefects
+convexityDefects
----------------
Finds the convexity defects of a contour.
-.. ocv:function:: void convexityDefects( InputArray points, InputArray convexhull, OutputArray convexityDefects )
+.. ocv:function:: void convexityDefects( InputArray contour, InputArray convexhull, OutputArray convexityDefects )
.. ocv:pyfunction:: cv2.ConvexityDefects(contour, convexhull)-> convexityDefects
CV_EXPORTS_W void convexHull( InputArray points, OutputArray hull,
bool clockwise=false, bool returnPoints=true );
//! computes the contour convexity defects
-CV_EXPORTS_W void convexityDefects( InputArray points, InputArray hull, OutputArray defects );
+CV_EXPORTS_W void convexityDefects( InputArray contour, InputArray convexhull, OutputArray convexityDefects );
-//! returns true iff the contour is convex. Does not support contours with self-intersection
+//! returns true if the contour is convex. Does not support contours with self-intersection
CV_EXPORTS_W bool isContourConvex( InputArray contour );
//! finds intersection of two convex polygons