June 1995
Intermediate to advanced
438 pages
10h 53m
English
Chin Norman, Department of Computer Science Columbia University New York, New York. E-mail address: nc@cs.columbia.edu
Binary space-partitioning (BSP) trees are data structures that allow for fast visible-surface determination in environments where the viewer moves while the polygonal objects remain static, as in interactive walkthroughs. This gem describes the construction of BSP trees and their traversal, which generates polygons in a sorted order suitable for rendering. It concludes with an efficient viewer/object collision detection algorithm based upon this versatile data structure.
One solution to the visible-surface problem is to render a scene’s polygons in back-to-front ...
Read now
Unlock full access