# Minimum bounding box algorithms

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.

## 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.

## Three dimensions

In 1985, Joseph O'Rourke published a cubic-time algorithm to find the minimum-volume enclosing box of a 3-dimensional point set. O'Rourke's approach uses a 3-dimensional rotating calipers technique. This algorithm has not been improved on as of August 2008, although heuristic methods for tackling the same problem have been developed.

Preparatory theorems in O'Rourke's work were proved to the effect that:

• There must exist two neighbouring faces of the smallest-volume enclosing box which both contain an edge of the convex hull of the point set. This criterion is satisfied by a single convex hull edge collinear with an edge of the box, or by two distinct hull edges lying in adjacent box faces.
• The other four faces need only contain a point of the convex hull. Again, the points which they contain need not be distinct: a single hull point lying in the corner of the box already satisfies three of these four criteria.

It follows in the most general case where no convex hull vertices lie in edges of the minimal enclosing box, that at least 8 convex hull points must lie within faces of the box: two endpoints of each of the two edges, and four more points, one for each of the remaining four box faces. Conversely, if the convex hull consists of 7 or fewer vertices, at least one of them must lie within an edge of the hull's minimal enclosing box.  The minimum bounding box of a regular tetrahedron

The minimal enclosing box of the regular tetrahedron is a cube, with side length 1/√2 that of the tetrahedron; for instance, a regular tetrahedron with side length √2 fits into a unit cube, with the tetrahedron's vertices lying at the vertices (0,0,0), (0,1,1), (1,0,1) and (0,1,1) of the unit cube.

• Smallest enclosing ball

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Minimum bounding box — The minimum or smallest bounding or enclosing box for a point set in N dimensions is the box with the smallest measure (area, volume, or hypervolume in higher dimensions) within which all the points lie. When other kinds of measure are used, the… …   Wikipedia

• Minimum bounding rectangle — The minimum bounding rectangle (MBR), also known as bounding box or envelope, is an expression of the maximum extents of a 2 dimensional object (e.g. point, line, polygon) within its 2 D (x, y) coordinate system, in other words min(x), max(x),… …   Wikipedia

• Bounding volume — A three dimensional model with its bounding box drawn in dashed lines. For building code compliance, see Bounding. In computer graphics and computational geometry, a bounding volume for a set of objects is a closed volume that completely contains …   Wikipedia

• Bounding interval hierarchy — A bounding interval hierarchy (BIH) is a partitioning data structure similar to that of bounding volume hierarchies or kd trees. Bounding interval hierarchies can be used in high performance (or real time) ray tracing and may be especially useful …   Wikipedia

• List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …   Wikipedia

• Список алгоритмов — Эта страница информационный список. Основная статья: Алгоритм Ниже приводится список алгоритмов, группированный по категориям. Более детальные сведения приводятся в списке структур данных и …   Википедия

• List of mathematics articles (M) — NOTOC M M estimator M group M matrix M separation M set M. C. Escher s legacy M. Riesz extension theorem M/M/1 model Maass wave form Mac Lane s planarity criterion Macaulay brackets Macbeath surface MacCormack method Macdonald polynomial Machin… …   Wikipedia

• List of combinatorial computational geometry topics — enumerates the topics of computational geometry that states problems in terms of geometric objects as discrete entities and hence the methods of their solution are mostly theories and algorithms of combinatorial character.See List of numerical… …   Wikipedia

• Joseph O'Rourke (professor) — Joseph O Rourke is a professor of computer science at Smith College. His main research interests are computational geometry and the philosophy of artificial intelligence.O Rourke was the first person to publish an algorithm to determine the… …   Wikipedia

• Axis-aligned object — In mathematics, an axis aligned object (axis parallel, axis oriented) is an object in n dimensional space whose shape is aligned with the coordinate axes of the space. Examples are axis aligned rectangles (or hyperrectangles), the ones with edges …   Wikipedia