Synthesis of Multiresolution Scenes with Global Illumination on a GPU

[Abstract] The radiosity computation has the important feature of producing view independent results, but these results are mesh dependent and, in consequence, are attached to a specific level of detail in the input mesh. Therefore, rendering at iterative frame rates would benefit from the utilization of multiresolution models. In this paper we focus on the rendering stage of a solution for hierarchical radiosity for multiresolution systems. This method is based on the application of an enriched hierarchical radiosity algorithm to an input scene with low resolution objects (represented by coarse meshes), and the efficient data management of the resulting values. The proposed encoding makes it possible to apply the color values obtained for the coarse objects to detailed versions of these objects during the rendering phase. These finer meshes are obtained by a standard mesh subdivision strategy, such as the Loop subdivision scheme. Our solution performs the whole rendering stage of this multiresolution approach on the GPU, implementing it in the geometry shader using Microsoft HLSL. Results of our implementation show an important reduction in computational costs

Development and Application of Computer Graphics Techniques for the Visualization of Large Geo-Related Data-Sets

Ziel dieser Arbeit war es, Algorithmen zu entwickeln und zu verbessern, die es gestatten, grosse geographische und andere geo-bezogene Datensätze mithilfe computergraphischer Techniken visualisieren zu können. Ein Schwerpunkt war dabei die Entwicklung neuer kamera-adaptiver Datenstrukturen für digitale Höhenmodelle und Rasterbilder. In der Arbeit wird zunächst ein neuartiges Multiresolutionmodell für Höhenfelder definiert. Dieses Modell braucht nur sehr wenig zusätzlichen Speicherplatz und ist geeignet, interaktive Anpassungsraten zu gewährleisten. Weiterhin werden Ansätze zur schnellen Bestimmung sichtbarer und verdeckter Teile einer computergraphischen Szene diskutiert, um die Bewegung in grossen und ausgedehnten Szenen wie Stadtmodellen oder Gebäuden zu beschleunigen. Im Anschluss daran werden einige Problemstellungen im Zusammenhang mit Texture Mapping erörtert, so werden zum Beispiel eine neue beobachterabhängige Datenstruktur für Texturdaten und ein neuer Ansatz zur Texturfilterung vorgestellt. Die meisten dieser Algorithmen und Verfahren wurden in ein interaktives System zur Geländevisualisierung integriert, das den Projektnamen 'FlyAway' hat und im letzten Kapitel der Arbeit beschrieben wird

Interactive global illumination on the CPU

Computing realistic physically-based global illumination in real-time remains one of the major goals in the fields of rendering and visualisation; one that has not yet been achieved due to its inherent computational complexity. This thesis focuses on CPU-based interactive global illumination approaches with an aim to develop generalisable hardware-agnostic algorithms. Interactive ray tracing is reliant on spatial and cache coherency to achieve interactive rates which conflicts with needs of global illumination solutions which require a large number of incoherent secondary rays to be computed. Methods that reduce the total number of rays that need to be processed, such as Selective rendering, were investigated to determine how best they can be utilised. The impact that selective rendering has on interactive ray tracing was analysed and quantified and two novel global illumination algorithms were developed, with the structured methodology used presented as a framework. Adaptive Inter- leaved Sampling, is a generalisable approach that combines interleaved sampling with an adaptive approach, which uses efficient component-specific adaptive guidance methods to drive the computation. Results of up to 11 frames per second were demonstrated for multiple components including participating media. Temporal Instant Caching, is a caching scheme for accelerating the computation of diffuse interreflections to interactive rates. This approach achieved frame rates exceeding 9 frames per second for the majority of scenes. Validation of the results for both approaches showed little perceptual difference when comparing against a gold-standard path-traced image. Further research into caching led to the development of a new wait-free data access control mechanism for sharing the irradiance cache among multiple rendering threads on a shared memory parallel system. By not serialising accesses to the shared data structure the irradiance values were shared among all the threads without any overhead or contention, when reading and writing simultaneously. This new approach achieved efficiencies between 77% and 92% for 8 threads when calculating static images and animations. This work demonstrates that, due to the flexibility of the CPU, CPU-based algorithms remain a valid and competitive choice for achieving global illumination interactively, and an alternative to the generally brute-force GPU-centric algorithms

Interactive raytraced caustics

technical reportIn computer graphics, bright patterns of light focused onto matte surfaces are called ?caustics?. We present a method for rendering dynamic scenes with moving caustics at interactive rates. This technique requires some simplifying assumptions about caustic behavior allowing us to consider it a local spatial property which we sample in a pre-processing stage. Storing the caustic locally limits caustic rendering to a simple lookup. We examine a number of ways to represent this data, allowing us to trade between accuracy, storage, run time, and precomputation time

Towards Predictive Rendering in Virtual Reality

The strive for generating predictive images, i.e., images representing radiometrically correct renditions of reality, has been a longstanding problem in computer graphics. The exactness of such images is extremely important for Virtual Reality applications like Virtual Prototyping, where users need to make decisions impacting large investments based on the simulated images. Unfortunately, generation of predictive imagery is still an unsolved problem due to manifold reasons, especially if real-time restrictions apply. First, existing scenes used for rendering are not modeled accurately enough to create predictive images. Second, even with huge computational efforts existing rendering algorithms are not able to produce radiometrically correct images. Third, current display devices need to convert rendered images into some low-dimensional color space, which prohibits display of radiometrically correct images. Overcoming these limitations is the focus of current state-of-the-art research. This thesis also contributes to this task. First, it briefly introduces the necessary background and identifies the steps required for real-time predictive image generation. Then, existing techniques targeting these steps are presented and their limitations are pointed out. To solve some of the remaining problems, novel techniques are proposed. They cover various steps in the predictive image generation process, ranging from accurate scene modeling over efficient data representation to high-quality, real-time rendering. A special focus of this thesis lays on real-time generation of predictive images using bidirectional texture functions (BTFs), i.e., very accurate representations for spatially varying surface materials. The techniques proposed by this thesis enable efficient handling of BTFs by compressing the huge amount of data contained in this material representation, applying them to geometric surfaces using texture and BTF synthesis techniques, and rendering BTF covered objects in real-time. Further approaches proposed in this thesis target inclusion of real-time global illumination effects or more efficient rendering using novel level-of-detail representations for geometric objects. Finally, this thesis assesses the rendering quality achievable with BTF materials, indicating a significant increase in realism but also confirming the remainder of problems to be solved to achieve truly predictive image generation

Doctor of Philosophy

dissertationWhile boundary representations, such as nonuniform rational B-spline (NURBS) surfaces, have traditionally well served the needs of the modeling community, they have not seen widespread adoption among the wider engineering discipline. There is a common perception that NURBS are slow to evaluate and complex to implement. Whereas computer-aided design commonly deals with surfaces, the engineering community must deal with materials that have thickness. Traditional visualization techniques have avoided NURBS, and there has been little cross-talk between the rich spline approximation community and the larger engineering field. Recently there has been a strong desire to marry the modeling and analysis phases of the iterative design cycle, be it in car design, turbulent flow simulation around an airfoil, or lighting design. Research has demonstrated that employing a single representation throughout the cycle has key advantages. Furthermore, novel manufacturing techniques employing heterogeneous materials require the introduction of volumetric modeling representations. There is little question that fields such as scientific visualization and mechanical engineering could benefit from the powerful approximation properties of splines. In this dissertation, we remove several hurdles to the application of NURBS to problems in engineering and demonstrate how their unique properties can be leveraged to solve problems of interest

Efficient physics-based room-acoustics modeling and auralization

The goal of this research is to develop efficient algorithms for physics-based room acoustics modeling and real-time auralization. Given the room geometry and wall materials, in addition to listener and sound source positions and other properties, the auralization system aims at reproducing the sound as would be heard by the listener in a corresponding physical setup. A secondary goal is to predict the room acoustics parameters reliably. The thesis presents a new algorithm for room acoustics modeling. The acoustic radiance transfer method is an element-based algorithm which models the energy transfer in the room like the acoustic radiosity technique, but is capable of modeling arbitrary local reflections defined as bidirectional reflectance distribution functions. Implementing real-time auralization requires efficient room acoustics modeling. This thesis presents three approaches for improving the speed of the modeling process. First, the room geometry can be reduced. For this purpose an algorithm, based on volumetric decomposition and reconstructions of the surface, is described. The algorithm is capable of simplifying the topology of the model and it is shown that the acoustical properties of the room are sufficiently well preserved with even 80 % reduction rates in typical room models. Second, some of the data required for room acoustics modeling can be precomputed. It is shown that in the beam tracing algorithm a visibility structure called "beam tree" can be precomputed efficiently, allowing even moving sound sources in simple cases. In the acoustic radiance transfer method, effects of the room geometry can be precomputed. Third, the run-time computation can be optimized. The thesis describes two optimization techniques for the beam tracing algorithm which are shown to speed up the process by two orders of magnitude. On the other hand, performing the precomputation for the acoustic radiance transfer method in the frequency domain allows a very efficient implementation of the final phase of the modeling on the graphics processing unit. An interactive auralization system, based on this technique is presented

Interactive caustics using local precomputed irradiance

Journal ArticleBright patterns of light focused via reflective or refractive objects onto matte surfaces are called "caustics". We present a method for rendering dynamic scenes with moving caustics at interactive rates. This technique requires some simplifying assumptions about caustic behavior allowing us to consider it a local spatial property which we sample in a pre-processing stage. Storing the caustic locally limits caustic rendering to a simple lookup. We examine a number of ways to represent this data, allowing us to trade between accuracy, storage, run time, and precomputation time

Efficient Streaming of 3D Scenes with Complex Geometry and Complex Lighting

International audienceStreaming data to efficiently render complex 3D scenes in presence of global illumination is still a challenging task. In this paper, we introduce a new data structure based on a 3D grid of irradiance vectors to store the indirect illumination appearing on complex and detailed objects: the Irradiance Vector Grid (IVG). This representation is independent of the geometric complexity and is suitable for quantization to different quantization schemes. Moreover, its streaming over network involves only a small overhead compared to detailed geometry, and can be achieved independently of the geometry. Furthermore, it can be efficiently rendered using modern graphics hardware. We demonstrate our new data structure in a new remote 3D visualization system, that integrates indirect lighting streaming and progressive transmission of the geometry, and study the impact of different strategies on data transfer