Binary Space Partitioning Trees*
Bruce F. Naylor†
University of Texas, Austin
21.2BSP Trees as a Multi-Dimensional Search Structure
Total Ordering of a Collection of Objects•Visibility Ordering as Tree Traversal•Intra-Object Visibility
21.4BSP Tree as a Hierarchy of Regions
Tree Merging•Good BSP Trees• Converting B-Reps to Trees• Boundary Representations vs. BSP Trees
In most applications involving computation with 3D geometric models, manipulating objects and generating images of objects are crucial operations. Performing these operations requires determining for every frame of an animation the spatial relations between objects: how they might intersect each other, and ...
Get Handbook of Data Structures and Applications, 2nd Edition 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.
