box".
The minimum bounding box of a point set is the same as the minimum bounding box of
its convex hull, a fact which may be used heuristically to speed up computation. [1]
The term "box"/"hyperrectangle" comes from its usage in the Cartesian coordinate
system, where it is indeed visualized as a rectangle (two-dimensional case), rectangular
parallelepiped (three-dimensional case), etc.
In the two-dimensional case it is called the minimum bounding rectangle.
Contents
1Axis-aligned minimum bounding box
2Arbitrarily oriented minimum bounding box
3Object-oriented minimum bounding box
4Digital image processing
5See also
6References
Axis-aligned minimum bounding box[edit]
The axis-aligned minimum bounding box (or AABB) for a given point set is its minimum
bounding box subject to the constraint that the edges of the box are parallel to the
(Cartesian) coordinate axes. It is the Cartesian product of N intervals each of which is
defined by the minimal and maximal value of the corresponding coordinate for the
points in S.
Axis-aligned minimal bounding boxes are used to an approximate location of an object
in question and as a very simple descriptor of its shape. For example, in computational
geometry and its applications when it is required to find intersections in the set of
objects, the initial check is the intersections between their MBBs. Since it is usually a
much less expensive operation than the check of the actual intersection (because it only
requires comparisons of coordinates), it allows quickly excluding checks of the pairs that
are far apart.
Arbitrarily oriented minimum bounding box[edit]
The arbitrarily oriented minimum bounding box is the minimum bounding box, calculated
subject to no constraints as to the orientation of the result. Minimum bounding box
algorithms based on the rotating calipers method can be used to find the minimum-area
or minimum-perimeter bounding box of a two-dimensional convex polygon in linear time,
and of a two-dimensional point set in the time it takes to construct its convex
hull followed by a linear-time computation.[1] A three-dimensional rotating calipers
algorithm can find the minimum-volume arbitrarily-oriented bounding box of a three-
dimensional point set in cubic time.[2] Matlab implementations of the latter as well as the
optimal compromise between accuracy and CPU time are available. [3]
Object-oriented minimum bounding box[edit]
In the case where an object has its own local coordinate system, it can be useful to
store a bounding box relative to these axes, which requires no transformation as the
object's own transformation changes.
Digital image processing[edit]
In digital image processing, the bounding box is merely the coordinates of the
rectangular border that fully encloses a digital image when it is placed over a page, a
canvas, a screen or other similar bidimensional background.
See also[edit]
Bounding sphere
Bounding volume
Minimum bounding rectangle
Darboux integral
References[edit]
1. ^ Jump up to:a b Toussaint, G. T (1983). "Solving geometric problems with
the rotating calipers" (PDF). Proc. MELECON '83, Athens.
2. ^ Joseph O'Rourke (1985), "Finding minimal enclosing
boxes", Parallel Programming, Springer Netherlands
3. ^ Chang, Chia-Tche; Gorissen, Bastien; Melchior, Samuel
(2018). "Matlab implementation of several minimum-volume bounding
box algorithms"..
Categories:
Geometry
Geometric algorithms
Navigation menu
Not logged in
Talk
Contributions
Create account
Log in
Article
Talk
Read
Edit
View history
Search
Search Go
Main page
Contents
Featured content
Current events
Random article
Donate to Wikipedia
Wikipedia store
Interaction
Help
About Wikipedia
Community portal
Recent changes
Contact page
Tools
What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Wikidata item
Cite this page
Print/export
Download as PDF
Printable version
Languages
Italiano
Português
Русский
Українська
Edit links
This page was last edited on 1 August 2019, at 10:05 (UTC).
Text is available under the Creative Commons Attribution-ShareAlike License; additional
terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy.
Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit
organization.
