You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Currently, the complexity of convexHull() is O(N log(N)) (N is the number of points) because the first step is std::sort(). If we calculate convex hull based on run-length encoding like https://docs.opencv.org/4.x/df/def/group__ximgproc__run__length__morphology.html the first step sorting is unnecessary, and the complexity becomes O(N) (N is the number of run length).
The text was updated successfully, but these errors were encountered:
Currently, the complexity of
convexHull()
is O(N log(N)) (N is the number of points) because the first step isstd::sort()
. If we calculate convex hull based on run-length encoding like https://docs.opencv.org/4.x/df/def/group__ximgproc__run__length__morphology.html the first step sorting is unnecessary, and the complexity becomes O(N) (N is the number of run length).The text was updated successfully, but these errors were encountered: