Lines Matching full:hull
3543 takes a 2D point set as input an additional preprocessing step of computing the convex hull of the
3569 /** @brief Finds the convex hull of a point set.
3571 The functions find the convex hull of a 2D point set using the Sklansky's algorithm @cite Sklansky82
3576 @param hull Output convex hull. It is either an integer vector of indices or vector of points. In
3577 the first case, the hull elements are 0-based indices of the convex hull points in the original
3578 array (since the set of convex hull points is a subset of the original point set). In the second
3579 case, hull elements are the convex hull points themselves.
3580 @param clockwise Orientation flag. If it is true, the output convex hull is oriented clockwise.
3584 returns convex hull points. Otherwise, it returns indices of the convex hull points. When the
3589 CV_EXPORTS_W void convexHull( InputArray points, OutputArray hull,
3599 @param convexhull Convex hull obtained using convexHull that should contain indices of the contour
3600 points that make the hull.
3606 farthest contour point and the hull. That is, to get the floating-point value of the depth will be
