Efficient view-dependent out-of-core visualization

@inproceedings{Guthe2004EfficientVO,
  title={Efficient view-dependent out-of-core visualization},
  author={Michael Guthe and Pavel Borodin and R. Klein},
  booktitle={International Conference On Virtual Reality and Its Applications in Industry},
  year={2004}
}
Hierarchical levels of details (HLODs) have proven to be an efficient way to visualize complex environments and models even in an out-of-core system. Large objects are partitioned into a spatial hierarchy and on each node a level of detail is generated for efficient view-dependent rendering. To ensure correct matching between adjacent nodes in the hierarchy care has to be taken to prevent cracks along the cuts. This either leads to severe simplification constraints at the cuts and thus to a… 
View on SPIE
cg.cs.uni-bonn.de
20 Citations
Background Citations
3
Methods Citations
5

20 Citations

Hlod refinement driven by hardware occlusion queries

A novel error metric is introduced, taking visibility information (gathered from HOQs) as an integral part of refining an HLOD model, this being the first approach within this context to the best of the authors' knowledge.

Real-time appearance preserving out-of-core rendering with shadows

A novel LOD selection and prefetching method for real-time rendering of hard shadows that entirely runs on a single CPU system is presented.

Real-time out-of-core trimmed NURBS rendering and editing

A high quality, out-ofcore trimmed NurBS rendering algorithm that supports both an automatic preprocessing of gigabyte sized models and a real-time rendering of the preprocessed models allowing for the seamless integration of interactive editing of the NURBS surfaces is presented.

High qualitiy simplification and repair of polygonal models

Of the three mesh simplification approaches presented here, the first one attempts to simplify polygonal models with the highest possible quality, the second, applies the developed technique to out-of-core simplification, and the third, prevents selfintersections of the model surface that can occur duringMesh simplification.

Dependency‐Free Parallel Progressive Meshes

A novel algorithm for real‐time view‐dependent rendering of gigabyte‐sized models based on a neighbourhood dependency‐free progressive mesh data structure suitable for parallel random‐access decompression and out‐of‐core memory management without storing decompressed data is proposed.

Out of Core Simplification with Appearance Preservation for Computer Game Applications

A vertex clustering technique that collapses all triangles in every leaf node using the generalized quadric error metrics is introduced and the proposed algorithm is capable in simplifying large datasets with pleasant quality and relatively fast.

Parallel mesh processing

The core contributions of this thesis are new algorithms and data structures which are specially developed for efficient parallel data processing which allow for real time rendering and editing of very complex models and scenes.

Out-of-Core Simplification with Guaranteed Error Tolerance

A high quality end-to-end out-of-core mesh simplification algorithm that is capable to guarantee a given geometric error compared to the original model and that uses a high quality simplification method during the whole reduction.

Towards predictive rendering in virtual reality

This thesis briefly introduces the necessary background and identifies the steps required for real-time predictive image generation, and existing techniques targeting these steps are presented and novel techniques proposed to solve some of the remaining problems.

RealReflect - Real-time Visualization of Complex Reflectance Behaviour in Virtual Protoyping

The RealReflect project is an endeavor to increase the realism of VR technology to levels where it can be used for meaningful qualitative reviews of real objects and provides a considerable benefit to those VR users groups who routinely have to make important design decisions about object appearance long before the actual product is first assembled.

References

SHOWING 1-10 OF 52 REFERENCES

Fat Borders : Gap Filling For Efficient View-dependent LOD Rendering

A novel solution to the gap problem of deformable trimmed NURBS models with dynamic neighbourhood in real-time by combining the new gap filling algorithm with an on-the-fly tessellation of the individual trimmed NurBS patches.

View-dependent refinement of progressive meshes

This paper defines efficient refinement criteria based on the view frustum, surface orientation, and screen-space geometric error, and develops a real-time algorithm for incrementally refining and coarsening the mesh according to these criteria.

Adaptive Real-Time Level-of-Detail-Based Rendering for Polygonal Models

The approach is more effective than the current level-of-detail-based rendering approaches for most scientific visualization applications, where there are a limited number of highly complex objects that stay relatively close to the viewer.

Efficient adaptive simplification of massive meshes

This paper presents a method for performing adaptive simplification of polygonal meshes that are too large to fit in-core, and exhibits output-sensitive memory requirements and allows fine control over the size of the simplified mesh.

Fat borders: gap filling for efficient view-dependent LOD NURBS rendering

View-dependent simplification of arbitrary polygonal environments

HDS is dynamic, retessellating the scene continually as the user's viewing position shifts, and global, processing the entire database without first decomposing the environment into individual objects.

XFastMesh: fast view-dependent meshing from external memory

An efficient external memory data structure and file format that stores all detail information of the multiresolution triangulation method using significantly less storage then previously reported approaches is presented.

Out-of-Core Streamline Visualization on Large Unstructured Meshes

An out-of-core approach for interactive streamline construction on large unstructured tetrahedral meshes containing millions of elements using an octree to partition and restructure the raw data into subsets stored into disk files for fast data retrieval.

MMR: an interactive massive model rendering system using geometric and image-based acceleration

A system for rendering very complex 3D models at interactive rates that automatically balances the screen-space errors resulting from geometric simplification with those from textureddepth-mesh distortion is presented.

HLODs for faster display of large static and dynamic environments

An algorithm and a system for accelerated display of massive static and dynamic environments using hierarchical simplification and automatically-generated hierarchical levels of detail (HLODs) that serve as higher fidelity drastic simplifications of entire branches of the scene graph are presented.
...