<s>
Kinetic	B-Data_Structure
minimum	I-Data_Structure
box	I-Data_Structure
is	O
a	O
kinetic	B-Data_Structure
data	I-Data_Structure
structure	I-Data_Structure
to	O
maintain	O
the	O
minimum	B-Algorithm
bounding	I-Algorithm
box	I-Algorithm
of	O
a	O
set	O
of	O
points	O
whose	O
positions	O
change	O
continuously	O
with	O
time	O
.	O
</s>
<s>
For	O
points	O
moving	O
in	O
a	O
plane	O
,	O
the	O
kinetic	B-Algorithm
convex	I-Algorithm
hull	I-Algorithm
data	O
structure	O
can	O
be	O
used	O
as	O
a	O
basis	O
for	O
a	O
responsive	O
,	O
compact	O
and	O
efficient	O
kinetic	B-Data_Structure
minimum	I-Data_Structure
box	I-Data_Structure
data	O
structure	O
.	O
</s>
<s>
The	O
2D	O
kinetic	B-Data_Structure
minimum	I-Data_Structure
box	I-Data_Structure
builds	O
on	O
the	O
2D	O
kinetic	B-Algorithm
convex	I-Algorithm
hull	I-Algorithm
in	O
a	O
manner	O
similar	O
to	O
the	O
kinetic	B-Data_Structure
width	I-Data_Structure
data	O
structure	O
which	O
maintains	O
the	O
pair	O
of	O
minimum-distance	O
parallel	O
lines	O
that	O
have	O
the	O
entire	O
point	O
set	O
between	O
them	O
.	O
</s>
<s>
In	O
this	O
case	O
,	O
since	O
a	O
box	O
consists	O
of	O
two	O
pairs	O
of	O
parallel	O
lines	O
(	O
that	O
are	O
perpendicular	O
to	O
each	O
other	O
)	O
,	O
analogy	O
can	O
be	O
made	O
with	O
running	O
two	O
perpendicular	O
kinetic	B-Data_Structure
width	I-Data_Structure
problems	O
,	O
and	O
the	O
data-structure	O
needs	O
to	O
maintain	O
sets	O
of	O
four	O
points	O
two	O
antipodal	O
pairs	O
which	O
have	O
perpendicular	O
supporting	O
lines	O
.	O
</s>
<s>
This	O
algorithm	O
can	O
be	O
kinetized	O
by	O
maintaining	O
the	O
convex	O
hull	O
in	O
a	O
kinetic	B-Algorithm
convex	I-Algorithm
hull	I-Algorithm
data	O
structure	O
,	O
the	O
merge	O
of	O
the	O
four	O
envelope	O
lists	O
in	O
a	O
kinetic	B-Data_Structure
sorted	I-Data_Structure
list	I-Data_Structure
and	O
the	O
boxes	O
in	O
a	O
kinetic	B-Application
priority	I-Application
queue	I-Application
.	O
</s>
<s>
The	O
responsiveness	O
and	O
compactness	O
of	O
this	O
data	O
structure	O
follow	O
from	O
those	O
of	O
the	O
kinetic	B-Algorithm
convex	I-Algorithm
hull	I-Algorithm
,	O
kinetic	B-Data_Structure
sorted	I-Data_Structure
list	I-Data_Structure
and	O
kinetic	B-Application
priority	I-Application
queue	I-Application
data	O
structures	O
.	O
</s>
