Rectangular box enclosing an object.

(military) A land mine which, when activated, uses a small propellant charge to toss the main body of the mine up to approximately waist height before exploding, in order to more efficiently injure its target.

In geometry, the minimum bounding box or smallest bounding box (also known as the minimum enclosing box or smallest enclosing box) for a point set in dimensions is the box with the smallest measure (area, volume, or hypervolume in higher dimensions) within which all the points lie.

A bounding volume hierarchy is a tree structure on a set of geometric objects.

(also known as leapfrogging, moving overwatch, or the buddy system) a military tactic of alternating movement of coordinated units to allow, if necessary, suppressive fire in support of offensive forward "fire and movement" or defensive "center peel" disengagement.

In computational geometry, the smallest enclosing box problem is that of finding the oriented minimum bounding box enclosing a set of points.

In computer graphics and computational geometry, a bounding volume (or bounding region) for a set of objects is a closed region that completely contains the union of the objects in the set.

In computational geometry, the minimum bounding rectangle, also known as bounding box or envelope, is an expression of the maximum extents of a two-dimensional object (e.g. point, line, polygon) or set of objects within its coordinate system; in other words , , , .

In mathematics, given a non-empty set of objects of finite extension in -dimensional space, for example a set of points, a bounding sphere, enclosing sphere or enclosing ball for that set is a -dimensional solid sphere containing all of these objects.