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:
“There are ... two minimum conditions necessary and sufficient for the existence of a legal system. On the one hand those rules of behavior which are valid according to the system’s ultimate criteria of validity must be generally obeyed, and on the other hand, its rules of recognition specifying the criteria of legal validity and its rules of change and adjudication must be effectively accepted as common public standards of official behavior by its officials.”
—H.L.A. (Herbert Lionel Adolphus)
“I fell her finger light
Laid pausefully upon life’s headlong train;—
The foot less prompt to meet the morning dew,
The heart less bounding at emotion new,
And hope, once crush’d, less quick to spring again.”
—Matthew Arnold (1822–1888)
“Sweet spring, full of sweet days and roses,
A box where sweets compacted lie;
My music shows ye have your closes,
And all must die.”
—George Herbert (1593–1633)