Minimum Bounding Box Algorithms
In computational geometry, the smallest enclosing box problem is that of finding the oriented minimum bounding box enclosing a set of points. It is a type of bounding volume. "Smallest" may refer to volume, area, perimeter, etc. of the box.
It is sufficient to find the smallest enclosing box for the convex hull of the objects in question. It is straightforward to find the smallest enclosing box that has sides parallel to the coordinate axes; the difficult part of the problem is to determine the orientation of the box.
Read more about Minimum Bounding Box Algorithms: Two Dimensions, Three Dimensions
Famous quotes containing the words minimum, bounding and/or box:
“After decades of unappreciated drudgery, American women just don’t do housework any more—that is, beyond the minimum that is required in order to clear a path from the bedroom to the front door so they can get off to work in the mourning.”
—Barbara Ehrenreich (20th century)
“Lame as I am, I take the prey,
Hell, earth, and sin with ease o’ercome;
I leap for joy, pursue my way,
And as a bounding hart fly home,
Through all eternity to prove,
Thy nature, and Thy name is Love.”
—Charles Wesley (1707–1788)
“The distant box is open. A sound of grain
Poured over the floor in some eagerness we
Rise with the night let out of the box of wind.”
—John Ashbery (b. 1927)