<s>
When	O
other	O
kinds	O
of	O
measure	O
are	O
used	O
,	O
the	O
minimum	O
box	O
is	O
usually	O
called	O
accordingly	O
,	O
e.g.	O
,	O
"	O
minimum-perimeter	O
bounding	B-Algorithm
box	I-Algorithm
"	O
.	O
</s>
<s>
The	O
minimum	B-Algorithm
bounding	I-Algorithm
box	I-Algorithm
of	O
a	O
point	O
set	O
is	O
the	O
same	O
as	O
the	O
minimum	B-Algorithm
bounding	I-Algorithm
box	I-Algorithm
of	O
its	O
convex	O
hull	O
,	O
a	O
fact	O
which	O
may	O
be	O
used	O
heuristically	O
to	O
speed	O
up	O
computation	O
.	O
</s>
<s>
In	O
the	O
two-dimensional	O
case	O
it	O
is	O
called	O
the	O
minimum	B-Algorithm
bounding	I-Algorithm
rectangle	I-Algorithm
.	O
</s>
<s>
The	O
axis-aligned	O
minimum	B-Algorithm
bounding	I-Algorithm
box	I-Algorithm
(	O
or	O
AABB	O
)	O
for	O
a	O
given	O
point	O
set	O
is	O
its	O
minimum	B-Algorithm
bounding	I-Algorithm
box	I-Algorithm
subject	O
to	O
the	O
constraint	O
that	O
the	O
edges	O
of	O
the	O
box	O
are	O
parallel	O
to	O
the	O
(	O
Cartesian	O
)	O
coordinate	O
axes	O
.	O
</s>
<s>
Axis-aligned	O
minimal	B-Algorithm
bounding	I-Algorithm
boxes	I-Algorithm
are	O
used	O
to	O
an	O
approximate	O
location	O
of	O
an	O
object	O
in	O
question	O
and	O
as	O
a	O
very	O
simple	O
descriptor	O
of	O
its	O
shape	O
.	O
</s>
<s>
The	O
arbitrarily	O
oriented	O
minimum	B-Algorithm
bounding	I-Algorithm
box	I-Algorithm
is	O
the	O
minimum	B-Algorithm
bounding	I-Algorithm
box	I-Algorithm
,	O
calculated	O
subject	O
to	O
no	O
constraints	O
as	O
to	O
the	O
orientation	O
of	O
the	O
result	O
.	O
</s>
<s>
Minimum	B-Algorithm
bounding	I-Algorithm
box	I-Algorithm
algorithms	I-Algorithm
based	O
on	O
the	O
rotating	B-Algorithm
calipers	I-Algorithm
method	O
can	O
be	O
used	O
to	O
find	O
the	O
minimum-area	O
or	O
minimum-perimeter	O
bounding	B-Algorithm
box	I-Algorithm
of	O
a	O
two-dimensional	O
convex	O
polygon	O
in	O
linear	O
time	O
,	O
and	O
of	O
a	O
three-dimensional	O
point	O
set	O
in	O
the	O
time	O
it	O
takes	O
to	O
construct	O
its	O
convex	O
hull	O
followed	O
by	O
a	O
linear-time	O
computation	O
.	O
</s>
<s>
A	O
three-dimensional	O
rotating	B-Algorithm
calipers	I-Algorithm
algorithm	O
can	O
find	O
the	O
minimum-volume	O
arbitrarily-oriented	O
bounding	O
box	O
of	O
a	O
three-dimensional	O
point	O
set	O
in	O
cubic	O
time	O
.	O
</s>
<s>
In	O
the	O
case	O
where	O
an	O
object	O
has	O
its	O
own	O
local	O
coordinate	O
system	O
,	O
it	O
can	O
be	O
useful	O
to	O
store	O
a	O
bounding	B-Algorithm
box	I-Algorithm
relative	O
to	O
these	O
axes	O
,	O
which	O
requires	O
no	O
transformation	O
as	O
the	O
object	O
's	O
own	O
transformation	O
changes	O
.	O
</s>
<s>
In	O
digital	B-Algorithm
image	I-Algorithm
processing	I-Algorithm
,	O
the	O
bounding	B-Algorithm
box	I-Algorithm
is	O
merely	O
the	O
coordinates	O
of	O
the	O
rectangular	O
border	O
that	O
fully	O
encloses	O
a	O
digital	B-Algorithm
image	I-Algorithm
when	O
it	O
is	O
placed	O
over	O
a	O
page	O
,	O
a	O
canvas	O
,	O
a	O
screen	O
or	O
other	O
similar	O
bidimensional	O
background	O
.	O
</s>
