DMCA
SumOriWork: No Years and Authors of Summarized Original Work Given Binary Space Partitions
BibTeX
@MISC{Dumitrescu_sumoriwork:no,
author = {Name Adrian Dumitrescu and Csaba D. Tóth and Adrian Dumitrescu and Csaba D. Tóth},
title = {SumOriWork: No Years and Authors of Summarized Original Work Given Binary Space Partitions},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The binary space partition (for short, BSP) is a scheme for subdividing the ambient space Rd into open convex sets (called cells) by hyperplanes in a recursive fashion. Each subdivision step for a cell results in two cells, in which the process may continue, independently of other cells, until a stopping criterion is met. The binary recursion tree, also called BSP-tree, is traditionally used as a data structure in computer graphics for efficient rendering of polyhedral scenes. Each node v of the BSP-tree, except for the leaves, corresponds to a cell Cv ⊆ Rd and a partitioning hyperplane Hv. The cell of the root r is Cr = Rd, and the two children of a node v correspond to Cv∩H−v and Cv∩H+v, where H−v and H v denote the open halfspaces bounded by Hv. Refer to Fig. 1. A binary space partition for a set of n pairwise disjoint (typically polyhedral) objects in Rd is a BSP where the space is recursively partitioned until each cell intersects at most one object. When the BSP-tree is used as a data structure, every leaf v stores the fragment of at most one object clipped in the cell Cv, and every interior node v stores the fragments of any lower-dimensional objects that lie in Cv ∩Hv. 2aa b c d b1 b2 c1 c2 d
Keyphrases
data structure binary space partition partitioning hyperplane hv open convex set recursive fashion b1 b2 c1 c2 cell result cell cv rd lower-dimensional object binary recursion tree open halfspaces interior node store subdivision step cell cv computer graphic stopping criterion cr rd polyhedral scene efficient rendering node correspond ambient space rd cv hv leaf store pairwise disjoint
