binary space-partitioning tree
binary space-partitioning tree (BSP tree) A description of a scene obtained by recursive binary splitting. The BSP tree formed the basis of an algorithm developed by Henry Fuchs et al in 1980 to generate realistic images of scenes composed of polygons (planes) where many images of the same static environment are required. The BSP tree's root node defines a chosen polygon in the image. The two subtrees define the set of polygons on either side of the root plane. At each level, this process is repeated. If polygons straddle the specified plane at any stage, the polygon is split into two parts. Node polygons are chosen to minimize the number of polygons that are split.
More From encyclopedia.com
Ipoh , Ipoh •capo • Gestapo •Aleppo, depot •downtempo, tempo, uptempo •Expo •cheapo, Ipoh, peep-bo, repo •hippo •hypo, typo •oppo, topo, troppo •compo • Lim… Bo Tree , Bo tree (Bodhi tree) In Buddhism, the pipal under which the Buddha (Siddhartha Gautama) found enlightenment (bodhi) at Bodh Gaya, near Varanasi, n In… Para Rubber Tree , rubber tree Any of several South American trees whose exudations can be made into rubber; especially Hevea brasiliensis (family Euphorbiaceae), a tal… Upas Tree , upas tree in folklore, a Javanese tree alleged to poison its surroundings and said to be fatal to approach. An account of the tree was given in the L… Tree Shrews , Tree shrews
tree shrew, small, arboreal mammal of the family Tupaiidae, found in S Asia. The 17 known species of tree shrews are classified as the or… tree fern , tree fern Tree-like fern of the family Cyatheaceae. Tree ferns grow in tropical and sub-tropical regions, particularly moist mountainous areas. Heigh…
About this article
binary space-partitioning tree
You Might Also Like
NEARBY TERMS
binary space-partitioning tree