CMPUT 498 Binary Space Partitioning

1
CMPUT 498Binary Space Partitioning

• Lecturer Sherif Ghali
• Department of Computing Science
• University of Alberta

2
BSP output

• Depth sorting
• back-to-front
• front-to-back
• z-buffer algorithm vs. depth sorting

3
Cyclic overlap

• A depth order may not exist

4
BSP in flatland

• Recursive partitioning
• Internal nodes store a partitioning line (plane)

5
BSP in flatland

• Each node corresponds to a face in 2D (cell in 3D)

6
Traversing a BSP tree
7
Building a BSP tree
8
Building a 3D BSP
9
Time and space
10
Reference
Chap. 12