Search results
Results from the WOW.Com Content Network
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 many applications the bounding box is aligned with the axes of the co-ordinate system, and it is then known as an axis-aligned bounding box (AABB). To distinguish the general case from an AABB, an arbitrary bounding box is sometimes called an oriented bounding box ( OBB ), or an OOBB when an existing object's local coordinate system is used.
In computer graphics, the slab method is an algorithm used to solve the ray-box intersection problem in case of an axis-aligned bounding box (AABB), i.e. to determine the intersection points between a ray and the box.
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 ...
Axis-Align Bounding Boxes (AABB) and cuboids are popular due to their simplicity and quick intersection tests. [9] Bounding volumes such as Oriented Bounding Boxes (OBB) , K-DOPs and Convex-hulls offer a tighter approximation of the enclosed shape at the expense of a more elaborate intersection test.
An example of a bounding volume hierarchy using rectangles as bounding volumes. A bounding volume hierarchy (BVH) is a tree structure on a set of geometric objects. All geometric objects, which form the leaf nodes of the tree, are wrapped in bounding volumes. These nodes are then grouped as small sets and enclosed within larger bounding volumes.
Minimum bounding boxes are often implicitly assumed to be axis-aligned. A more general case is rectilinear polygons , the ones with all sides parallel to coordinate axes or rectilinear polyhedra. Many problems in computational geometry allow for faster algorithms when restricted to (collections of) axis-oriented objects, such as axis-aligned ...
AABB—Axis Aligned Bounding Box; AAC—Advanced Audio Coding; AAL—ATM Adaptation Layer; AALC—ATM Adaptation Layer Connection; AARP—AppleTalk Address Resolution Protocol; ABAC—Attribute-Based Access Control; ABCL—Actor-Based Concurrent Language; ABI—Application Binary Interface; ABM—Asynchronous Balanced Mode; ABR—Area Border Router