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

  title={Real-time appearance preserving out-of-core rendering with shadows},
  author={Michael Guthe and Pavel Borodin and {\'A}kos Bal{\'a}zs and R. Klein},
  booktitle={Rendering Techniques},
Despite recent advances in finding efficient LOD-representations for gigantic 3D objects, rendering of complex, gigabyte-sized models and environments is still a challenging task, especially under real-time constraints and high demands on the visual accuracy. The two general approaches are using either a polygon- or a point-based representation for the simplified geometry. With the polygon-based approaches high frame rates can be achieved by sacrificing the exact appearance and thus the image… 

Figures and Tables from this paper

Towards Perceptual Simplification of Models with Arbitrary Materials

This paper introduces a perceptually based metric depending on the contrast and spatial frequency of the model at a single vertex to avoid a costly per‐pixel comparison and introduces an efficient simplification algorithm based on the human visual system.

Hybrid Sample-based Surface Rendering

This work proposes an alternative rendering pipeline implementation that uses rasterization and ray-casting in every frame simultaneously to determine eye-ray intersections and introduces a memory-efficient sample-based data structure which gives rise to an efficient ray traversal procedure.

Identifying Planes in Point Clouds for Efficient Hybrid Rendering

A hybrid rendering technique for highfeature colored point clouds that achieves both, high performance and high quality, and the spatial subdivision facilitates handling out-of-core point clouds, both in preprocessing and rendering.

Parallel View-Dependent Out-of-Core Progressive Meshes

This paper proposes a new algorithm for real-time view-dependent rendering of huge models, optimized for parallel GPU-processing and out-of-core memory management, and presents a compact data structure for progressive meshes.

Parallel View-Dependent Refinement of Compact Progressive Meshes

A compact data structure for progressive meshes optimized for parallel processing and low memory consumption on the GPU is introduced and an efficient LOD adaption algorithm is presented resulting in anAdaption time almost equal to the rendering time of the adapted mesh.

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.

Preserving Shadow Silhouettes in Illumination‐Driven Mesh Reduction

This work extends illumination‐driven mesh reduction with occluder information, focusing on their silhouettes as well as combining it with commonly used error quadrics to preserve geometric features, resulting in an image visually similar to an unreduced rendering and enabling out‐of‐core operation.

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.

An Accelerating Rendering Method of Hybrid Point and Polygon for Complex Three-Dimensional Models

This paper presents an accelerating hybrid rendering method for complex three-dimensional models using both points and polygons that fully utilize the parallelism nature of GPU and efficiently implement a continuous multi-resolution rendering for HPPO (Hybrid Point and Polygon Object).

Compression, modeling, and real-time rendering of realistic materials and objects

A novel perception-based simplification metric that includes the material of an object is introduced that allows for a more aggressive simplification in regions where geometric metrics do not simplify.



Appearance-preserving simplification

A new algorithm is presented that not only does it generate a low-polygon-count approximation of a model, but it also preserves the appearance, and is applied to several large models achieving significant amounts of simplification with little or no loss in rendering quality.

Fast, Practical and Robust Shadows

We present a set of algorithms for rendering shadows using the stencil buffer and shadow volume geometry. It can achieve greater performance than previous methods by applying a series of techniques

Fast view-dependent level-of-detail rendering using cached geometry

This paper presents the CABTT algorithm, an extension to existing binary-triangle-tree-based level-of-detail algorithms that operates on clusters of geometry called aggregate triangles, instead of manipulating triangles, which reduces CPU overhead and fully utilizes the hardware accelerated rendering pipeline on modern video cards.

Efficient image-based methods for rendering soft shadows

The first approach—layered attenuation maps—achieves interactive rendering rates, but limits sampling flexibility, while the second method—coherence-based raytracing of depth images—is not interactive, but removes the limitations on sampling and yields high quality images at a fraction of the cost of conventional raytracers.

Perceptually guided simplification of lit, textured meshes

This work uses a simple model of low-level human vision to estimate the perceptibility of local simplification operations in a view-dependent Multi-Triangulation structure and improves on prior perceptual simplification approaches by accounting for textured models and dynamic lighting effects.

Real Time, Accurate, Multi‐Featured Rendering of Bump Mapped Surfaces

We present a new technique to render in real time objects which have part of their high frequency geometric detail encoded in bump maps. It is based on the quantization of normal‐maps, and achieves

Interactive shadow generation in complex environments

An algorithm for computing a compact potentially visible set (PVS) using levels-of-detail (LODs) and visibility culling and a combination of shadow-polygons and shadow maps to generate shadows is presented.

Efficient High Quality Rendering of Point Sampled Geometry

An efficient rendering algorithm is presented that exploits the hierarchical structure of the representation to perform fast 3D transformations and shading and is extended to surface splatting which yields high quality anti-aliased and water tight surface renderings.

Real-Time Soft Shadows Using a Single Light Sample

A real-time rendering algorithm that generates soft shadows of dynamic scenes using a single light sample based on a bivariate attenuation function, whose result modulates the intensity of a light causing shadows.

Efficient view-dependent out-of-core visualization

This paper presents an out-of-core visualization algorithm that overcomes the cracks generated by the simplification algorithm with appropriately shaded fat borders and comes up with a simple nevertheless efficient view-dependent rendering technique which allows for the natural incorporation of state-of theart culling, simplification, compression and prefetching techniques.