Visibility and Hidden Surface Removal

BSP algorithm
• Binary space partitioning of object space to
create a binary tree – object-space algorithm
• Tree traversal gives back-to-front ordering
depending on view point
• Creating/updating the tree is time- and
space-intensive (do it in preprocessing), but
traversal is not – efficient for static group of
polygons and dynamic view
• Basic idea: render polygons in the half-
© Machiraju/Zhang/Möller
space at the back first, then front 64