Minimum Bounding Box Algorithms - Two Dimensions

Two Dimensions

For the convex polygon, a linear time algorithm for the minimum-area enclosing rectangle is known. It is based on the observation that a side of a minimum-area enclosing box must be collinear with a side of the convex polygon. It is possible to enumerate boxes of this kind in linear time with the approach called rotating calipers by Godfried Toussaint in 1983. The same approach is applicable for finding the minimum-perimeter enclosing rectangle.

Read more about this topic:  Minimum Bounding Box Algorithms

Famous quotes containing the word dimensions:

    Words are finite organs of the infinite mind. They cannot cover the dimensions of what is in truth. They break, chop, and impoverish it.
    Ralph Waldo Emerson (1803–1882)

    Why is it that many contemporary male thinkers, especially men of color, repudiate the imperialist legacy of Columbus but affirm dimensions of that legacy by their refusal to repudiate patriarchy?
    bell hooks (b. c. 1955)