Computing Dynamic Changes to BSP Trees

Simple item page
dc.contributor.authorChrysanthou, Y.en_US
dc.contributor.authorSlater, M.en_US
dc.date.accessioned2014-10-21T07:20:12Z
dc.date.available2014-10-21T07:20:12Z
dc.date.issued1992en_US
dc.description.abstractThis paper investigates a new method for dynamically changing Binary Space Partition (BSP) trees. A BSP tree representation of a 3D polygonal scene provides an ideal data structure for rapidly performing the hidden surface computations involved in changing the viewpoint. However, BSP trees have generally been thought to be unsuitable for applications where the geometry of objects in the scene changes dynamically. The purpose of this paper is to introduce a dynamic BSP tree algorithm which does allow for such changes, and which maintains the simplicity and integrity of the BSP tree representation. The algorithm is extended to include dynamic changes to shadows. We calibrate the algorithms by transforming a range of objects in a scene, and reporting on the observed timing results.en_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume11en_US
dc.identifier.doi10.1111/1467-8659.1130321en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages321-332en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.1130321en_US
dc.publisherBlackwell Science Ltd and the Eurographics Associationen_US
dc.titleComputing Dynamic Changes to BSP Treesen_US
Files
Collections
Issue 3
EG 1992 Conference Proceedings