Chapter 10
Working with large 2D/3D data sets
10.1.1 Axis-Aligned Bounding Box (AABB)
10.1.4 Oriented Bounding Box (OBB)
10.3 Nested (hierarchical) grids
10.6 Binary Space Partitioning (BSP) tree
10.7 Bounding Volume Hierarchy (BVH)
Working with large sets of objects, whether in 2D or in 3D, often requires performing various spatial queries to locate objects satisfying certain spatial conditions.
An example of a spatial query may be to find all objects in the given area or near the given object or to find the first object intersected by a given ray and so on.
Despite the ...
Get Computer Graphics now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
