These data structures have leaf nodes representing front and back perspectives.
An algorithm for computing dynamic changes to these data structures was developed by Chrysanthou and Slater. A paper by Chin and Feiner extended the use of this data structure to the problem of generating shadow volumes. This data structure was developed by Fuchs, Kedem, and Naylor. Merging two of these structures, which can be done in logarithmic time, forms the basis for the set operations of constructive solid geometry. k-d trees are a subset of these structures. These structures are created by recursive subdivision of a volume by (*) hyperplanes. A standard use of these structures is to specify a polygon rendering order for the painter's algorithm. These data structures have leaf nodes representing front and back perspectives. For 10 points, name these tree structures used in computer graphics in which each node represents a hyperplane that splits the world in half.
An algorithm for computing dynamic changes to these data structures was developed by Chrysanthou and Slater.
binary space partition tree [or BSP tree; prompt on tree or partition tree or binary tree, prompt on k-d tree before it's mentioned; do NOT accept or prompt on "binary search tree"]