The function cvConvexHull2 finds convex hull of 2D point set using Sklansky's algorithm.

C# | Visual Basic | Visual C++ |
public static IntPtr cvConvexHull2( IntPtr input, IntPtr hullStorage, ORIENTATION orientation, int returnPoints )
Public Shared Function cvConvexHull2 ( _ input As IntPtr, _ hullStorage As IntPtr, _ orientation As ORIENTATION, _ returnPoints As Integer _ ) As IntPtr
public: static IntPtr cvConvexHull2( IntPtr input, IntPtr hullStorage, ORIENTATION orientation, int returnPoints )

- input (IntPtr)
- Sequence or array of 2D points with 32-bit integer or floating-point coordinates
- hullStorage (IntPtr)
- The destination array (CvMat*) or memory storage (CvMemStorage*) that will store the convex hull. If it is array, it should be 1d and have the same number of elements as the input array/sequence. On output the header is modified so to truncate the array downto the hull size
- orientation (ORIENTATION)
- Desired orientation of convex hull: CV_CLOCKWISE or CV_COUNTER_CLOCKWISE
- returnPoints (Int32)
- If non-zero, the points themselves will be stored in the hull instead of indices if hull_storage is array, or pointers if hull_storage is memory storage

If hull_storage is memory storage, the function creates a sequence containing the hull points or pointers to them, depending on return_points value and returns the sequence on output