/*F///////////////////////////////////////////////////////////////////////////////////////
 //    Name: cvConvexHull
 //    Purpose:
 //      Finds convex hull of points set
 //    Context:
 //    Parameters:
 //      input        - 
 //      hull_storage - 
 //      orientation  -
 //      return_points-
 //    Returns:
 //    Notes: Function computes convex hull and stores result in "hull" array,
 //           where every vertex of convex hull is represented by index in input array.
 //
 //F*/
 OPENCVAPI void cvConvexHull( CvArr* input, void* hull_storage, int orientation,
                           int return_points);

 /*F///////////////////////////////////////////////////////////////////////////////////////
 //    Name: cvContourConvexHull
 //    Purpose:
 //      Finds convex hull of contour
 //    Context:
 //    Parameters:
 //      contour      - pointer to CvSeq structure, which elements are CvPoints
 //      orientation  - orientation of convex hull you want to get
 //                     can be CV_CLOCKWISE or CV_COUNTER_CLOCKWISE
 //      storage      - pointer to memory storage, where output sequence will be stored
 //    Returns:
 //      Convex hull
 //    Notes: Function computes convex hull and returns it.
 //           Every vertex of convex hull is represented by pointer to original point,
 //           stored in input sequence, i.e. result is CvSeq which elements
 //           have type CvPoint*
 //F*/
 OPENCVAPI CvSeq*  cvContourConvexHull( CvSeq* contour, int orientation,
                                     CvMemStorage* storage );

 /*F///////////////////////////////////////////////////////////////////////////////////////
 //    Name: cvCheckContourConvexity
 //    Purpose:
 //      Checks if contour is convex or not
 //    Context:
 //    Parameters:
 //      contour - input contour
 //
 //    Returns: 0 - contour is not convex
 //             1 - contour is convex
 //    Notes:
 //F*/
 OPENCVAPI int  cvCheckContourConvexity( CvSeq* contour );

 /*F///////////////////////////////////////////////////////////////////////////////////////
 //    Name: cvConvexityDefects
 //    Purpose:
 //      Computes convexity defects of contour
 //    Context:
 //    Parameters:
 //      contour      - pointer to CvSeq structure, which elements are CvPoints
 //      convexhull   - pointer to convex hull of input contour
 //      storage      - pointer to memory storage, where output sequence will be stored
 //    Returns:
 //      sequence of convexity defects
 //      (i.e. the resultant sequence elements have type CvConvexityDefect).
 //    Notes:
 //F*/
 OPENCVAPI CvSeq*  cvConvexityDefects( CvSeq* contour, CvSeq* convexhull,
                                       CvMemStorage* storage );

 /*F///////////////////////////////////////////////////////////////////////////////////////
 //    Name: cvFitEllipse
 //    Purpose:
 //      Fits "least-square optimal" ellipse into the set of points
 //    Context:
 //    Parameters:
 //      points       - array of 2D points with float coordinates
 //      n            - number of input points
 //      box          - output structure which contents center of ellipse
 //                     full sizes of ellipse axis and angle to horisont
 //    Returns:
 //    Notes:
 //F*/
 OPENCVAPI void  cvFitEllipse( CvPoint2D32f* points, int n, CvBox2D* box );

 /*F///////////////////////////////////////////////////////////////////////////////////////
 //    Name: cvMinAreaRect
 //    Purpose:
 //      For set of points finds enclosing rectangle which has minimal area among all such
 //      rectangles. Function uses Toussaint algorithm(rotating calipers)
 //    Context:
 //    Parameters:
 //       points - input points
 //       n      - number of points
 //       left,
 //       bottom,
 //       right,
 //       top    - indices in input array of most left, bottom, right and top points
 //       anchor - coordinates of one of corners of output rectangle
 //       vect1,
 //       vect2  - two vectors, which represents sides of rectangle which are incident
 //                to anchor
 //    Returns:
 //    Notes:
 //F*/
 OPENCVAPI void  cvMinAreaRect( CvPoint* points, int n,
                              int left, int bottom, int right, int top,
                              CvPoint2D32f* anchor,
                              CvPoint2D32f* vect1,
                              CvPoint2D32f* vect2 );

 /*F///////////////////////////////////////////////////////////////////////////////////////
 //    Name: cvMinEnclosingCircle
 //    Purpose:
 //      Finds minimal enclosing circle for point set
 //    Context:
 //    Parameters:
 //      seq      - sequence of points
 //      center   - center of min enclosing circle
 //      radius   - radius of enclosing circle
 //    Returns:
 //    Notes:
 //F*/
 OPENCVAPI  void  cvMinEnclosingCircle( CvSeq* seq, CvPoint2D32f* center, float* radius );