HDoV-tree: the structure, the storage, the speed (original) (raw)
Related papers
Presence: Teleoperators and Virtual Environments, 2004
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 uses only 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 walk-through, parts of the sample tree are loaded from a local or remote hard disk. We implement our algorithm in a prototypical walk-through system. Analysis and exper...
Gyrolayout: A Hyperbolic Level-of-Detail Tree Layout
J. Univers. Comput. Sci., 2013
Many large datasets can be represented as hierarchical structures, introducing not only the necessity of specialized tree visualization techniques, but also the requirements of handling large amounts of data and offering the user a useful insight into them. Many two-dimensional techniques have been developed, but 3-dimensional ones, together with navigational interactions, present a promising appropriate tool to deal with large trees. In this paper we present a hyperbolic tree layout extended to support different levelof-detail techniques and suitable for large tree representation and visualization. This layout permits the visualization of large trees with different level of detail in an enclosed 3-dimensional volume. As a significant part of the layout, we also present a Weighted Spherical Centroidal Voronoi Tessellation, an extension of planar Weighted Centroidal Voronoi Tessellations, in order to find an appropriate distribution of nodes on a spherical surface.