The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments

J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, F. Meyer auf der Heide, Presence: Teleoperators and Virtual Environments (2004) 617–637.

Download
No fulltext has been uploaded.
Journal Article | Published | English
Author
; ; ; ; ;
Abstract
We present a new data structure for rendering highly complex virtual environments of arbitrary topology. The special feature of our approach is that it allows an interactive navigation in very large scenes (30 GB/400 million polygons in our benchmark scenes) that cannot be stored in main memory, but only on a local or remote hard disk. Furthermore, it allows interactive rendering of substantially more complex scenes by instantiating objects. The sampling process is done in the preprocessing. There, the polygons are randomly distributed in our hierarchical data structure, the randomized sample tree. This tree only uses space that is linear in the number of polygons. In order to produce an approximate image of the scene, the tree is traversed and polygons stored in the visited nodes are rendered. During the interactive walkthrough, parts of the sample tree are loaded from local or remote hard disk. We implemented our algorithm in a prototypical walkthrough system. Analysis and experiments show that the quality of our images is comparable to images computed by the conventional z-buffer algorithm regardless of the scene topology.
Publishing Year
Journal Title
Presence: Teleoperators and Virtual Environments
Page
617-637
LibreCat-ID

Cite this

Klein J, Krokowski J, Fischer M, Wand M, Wanka R, Meyer auf der Heide F. The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments. Presence: Teleoperators and Virtual Environments. 2004:617-637. doi:10.1162/1054746043280619
Klein, J., Krokowski, J., Fischer, M., Wand, M., Wanka, R., & Meyer auf der Heide, F. (2004). The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments. Presence: Teleoperators and Virtual Environments, 617–637. https://doi.org/10.1162/1054746043280619
@article{Klein_Krokowski_Fischer_Wand_Wanka_Meyer auf der Heide_2004, title={The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments}, DOI={10.1162/1054746043280619}, journal={Presence: Teleoperators and Virtual Environments}, author={Klein, Jan and Krokowski, Jens and Fischer, Matthias and Wand, Michael and Wanka, Rolf and Meyer auf der Heide, Friedhelm}, year={2004}, pages={617–637} }
Klein, Jan, Jens Krokowski, Matthias Fischer, Michael Wand, Rolf Wanka, and Friedhelm Meyer auf der Heide. “The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments.” Presence: Teleoperators and Virtual Environments, 2004, 617–37. https://doi.org/10.1162/1054746043280619.
J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, and F. Meyer auf der Heide, “The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments,” Presence: Teleoperators and Virtual Environments, pp. 617–637, 2004.
Klein, Jan, et al. “The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments.” Presence: Teleoperators and Virtual Environments, 2004, pp. 617–37, doi:10.1162/1054746043280619.

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar