c++ - opencv: Time complexity to detect minimum rectangle -

I am starting to find the minimum rectangle with opencv I need to calculate the complexity of time for this, but Still confused about these methods:

1. findContours ().
2. minAreaRect ()

Anyone can help me

commendable

cv :: findContours () receives compound binary image algorithm ():

< P> Suzuki, S. and Abe, K., Topological Structural Analysis of Binary images digitized after Border. Sivijiaipi 30 1, pp 32-46 (1 9 85)

are tracking at the edges by considering the topological analysis of the basic concept of this algorithm. Therefore, the relationship between the inner and outer edges is drawn. In practice, the algorithm discriminates between external and internal borders and classifies them sequentially, so the contour is considered "parent" in a contour form around the uniform. The

On the other hand Cv :: minAreaRect () oriented to engage a set of points that finds the minimum bounding box is a type of bounding volume object convex hull The box for the smallest size is enough to find. For a convex polygon, a linear time algorithm is known for the minimum-area enclosed rectangle. It is based on observation that one side of an enclosed box of the minimum area must be a parallel to the convex polygon (see []).

It is possible to calculate this type of box in linear time.