Direct Ray tracing of smoothed and displacement mapped triangles

Journal ArticleWe present an algorithm for ray tracing displacement maps that requires no additional storage over the base model. Displacement maps are rarely used in ray tracing due to the cost associated with storing and intersecting the displaced geometry. This is unfortunate because displacement maps allow the addition of large amounts of geometric complexity into models. Our method works for models composed of triangles with normals at the vertices. In addition, we present a special purpose displacement that creates a smooth surface that interpolates the triangle vertices and normals. Thus two adjacent triangles which share two vertices and normals will be smoothly interpolated. This combination allows relatively coarse models to be displacement mapped and ray traced with much less storage and fewer artifacts due to tessellation

3D Particle Tracking Velocimetry Method: Advances and Error Analysis

A full three-dimensional particle tracking system was developed and tested. By using three separate CCDs placed at the vertices of an equilateral triangle, the threedimensional location of particles can be determined. Particle locations measured at two different times can then be used to create a three-component, three-dimensional velocity field. Key developments are: the ability to accurately process overlapping particle images, offset CCDs to significantly improve effective resolution, allowance for dim particle images, and a hybrid particle tracking technique ideal for three-dimensional flows when only two sets of images exist. An in-depth theoretical error analysis was performed which gives the important sources of error and their effect on the overall system. This error analysis was verified through a series of experiments, which utilized a test target with 100 small dots per square inch. For displacements of 2.54mm the mean errors were less than 2% and the 90% confidence limits were less than 5.2 μm in the plane perpendicular to the camera axis, and 66 μm in the direction of the camera axis. The system was used for flow measurements around a delta wing at an angle of attack. These measurements show the successful implementation of the system for three-dimensional flow velocimetry

Rendering Curved Triangles on the GPU

This Thesis presents a new approach to render triangular Bézier patches in real time. The goal is to achieve a very good visual quality, avoid artifacts in the silhouette, and get in nite detail. Our approach consists in a ray casting technique to render tri- angular B ezier patches in real time. It is based on previous work explained in this document to implement a fast ray-surface intersec- tion technique. This previous work consists in adapting Newton's method to implement the intersections achieving interactive framer- ates ray casting di erent surfaces. The main contributions of our approach are adapting New- ton's method to perform intersections with triangular bicubic B ezier patches and implementing it in GPU to optimize performance using graphics hardware. Finally, we also contribute adapting the normal mapping tech- nique to shade the models and, thus, achieve even greater detail

AlSub: Fully Parallel and Modular Subdivision

In recent years, mesh subdivision---the process of forging smooth free-form surfaces from coarse polygonal meshes---has become an indispensable production instrument. Although subdivision performance is crucial during simulation, animation and rendering, state-of-the-art approaches still rely on serial implementations for complex parts of the subdivision process. Therefore, they often fail to harness the power of modern parallel devices, like the graphics processing unit (GPU), for large parts of the algorithm and must resort to time-consuming serial preprocessing. In this paper, we show that a complete parallelization of the subdivision process for modern architectures is possible. Building on sparse matrix linear algebra, we show how to structure the complete subdivision process into a sequence of algebra operations. By restructuring and grouping these operations, we adapt the process for different use cases, such as regular subdivision of dynamic meshes, uniform subdivision for immutable topology, and feature-adaptive subdivision for efficient rendering of animated models. As the same machinery is used for all use cases, identical subdivision results are achieved in all parts of the production pipeline. As a second contribution, we show how these linear algebra formulations can effectively be translated into efficient GPU kernels. Applying our strategies to $\sqrt{3}$, Loop and Catmull-Clark subdivision shows significant speedups of our approach compared to state-of-the-art solutions, while we completely avoid serial preprocessing.Comment: Changed structure Added content Improved description

Doctor of Philosophy

dissertationRay tracing presents an efficient rendering algorithm for scientific visualization using common visualization tools and scales with increasingly large geometry counts while allowing for accurate physically-based visualization and analysis, which enables enhanced rendering and new visualization techniques. Interactivity is of great importance for data exploration and analysis in order to gain insight into large-scale data. Increasingly large data sizes are pushing the limits of brute-force rasterization algorithms present in the most widely-used visualization software. Interactive ray tracing presents an alternative rendering solution which scales well on multicore shared memory machines and multinode distributed systems while scaling with increasing geometry counts through logarithmic acceleration structure traversals. Ray tracing within existing tools also provides enhanced rendering options over current implementations, giving users additional insight from better depth cues while also enabling publication-quality rendering and new models of visualization such as replicating photographic visualization techniques

Photorealistic physically based render engines: a comparative study

Pérez Roig, F. (2012). Photorealistic physically based render engines: a comparative study. http://hdl.handle.net/10251/14797.Archivo delegad

Semi-transparent textures based on opaque and transparent texels augmented with a thickness

Le rendu en temps réel repose sur des compromis entre la performance et le réalisme. Un de ces compromis est de représenter des matériaux plus minces tels que les tissus comme étant infiniment minces pour économiser mémoire et temps de rendu. Par contre, cette perte de dimension prive la surface de propriétés essentielles à certains effets visuels. Dans ce mémoire, nous présentons une méthode pour simuler les effets de l’épaisseur sur des surfaces semi-transparentes en utilisant des textures composées de texels opaques et transparents. Nous analysons les trous formés par les texels transparents et nous conservons de l’information sur les contours des trous dans une structure hiérarchique compatible avec la méthode de filtrage de textures par MIP map. Nous dérivons des équations représentant la proportion de lumière passant dans un trou avec des murs intérieurs en fonction de l’angle incident des rayons de lumière. Nous combinons ces équations avec l’information conservée pour calculer un terme de transparence à différents niveaux de détail en temps réel.Real-time rendering is built upon compromises between performance and realism. One such compromise is to represent thinner materials like textile as infinitely thin in order to save on memory and rendering time. However, this loss of dimension robs the surface of properties key to some visual effects. In this thesis, we present a method to simulate the effects of thickness on semi-transparent surfaces using textures consisting of opaque and transparent texels. We analyze holes formed by transparent texels and store information about the contours of the holes in a hierarchical structure compatible with the filtering method of MIP mapping. We derive equations representing the proportion of light passing through a hole as a function of the incident angle of light. The proportions of texel top, texel side wall, and hole are computed accurately. We combine these equations with the information stored to compute a transparency term at different levels of detail in real time

Efficient From-Point Visibility for Global Illumination in Virtual Scenes with Participating Media

Sichtbarkeitsbestimmung ist einer der fundamentalen Bausteine fotorealistischer Bildsynthese. Da die Berechnung der Sichtbarkeit allerdings äußerst kostspielig zu berechnen ist, wird nahezu die gesamte Berechnungszeit darauf verwendet. In dieser Arbeit stellen wir neue Methoden zur Speicherung, Berechnung und Approximation von Sichtbarkeit in Szenen mit streuenden Medien vor, die die Berechnung erheblich beschleunigen, dabei trotzdem qualitativ hochwertige und artefaktfreie Ergebnisse liefern

Meshless Mechanics and Point-Based Visualization Methods for Surgical Simulations

Computer-based modeling and simulation practices have become an integral part of the medical education field. For surgical simulation applications, realistic constitutive modeling of soft tissue is considered to be one of the most challenging aspects of the problem, because biomechanical soft-tissue models need to reflect the correct elastic response, have to be efficient in order to run at interactive simulation rates, and be able to support operations such as cuts and sutures. Mesh-based solutions, where the connections between the individual degrees of freedom (DoF) are defined explicitly, have been the traditional choice to approach these problems. However, when the problem under investigation contains a discontinuity that disrupts the connectivity between the DoFs, the underlying mesh structure has to be reconfigured in order to handle the newly introduced discontinuity correctly. This reconfiguration for mesh-based techniques is typically called dynamic remeshing, and most of the time it causes the performance bottleneck in the simulation. In this dissertation, the efficiency of point-based meshless methods is investigated for both constitutive modeling of elastic soft tissues and visualization of simulation objects, where arbitrary discontinuities/cuts are applied to the objects in the context of surgical simulation. The point-based deformable object modeling problem is examined in three functional aspects: modeling continuous elastic deformations with, handling discontinuities in, and visualizing a point-based object. Algorithmic and implementation details of the presented techniques are discussed in the dissertation. The presented point-based techniques are implemented as separate components and integrated into the open-source software framework SOFA. The presented meshless continuum mechanics model of elastic tissue were verified by comparing it to the Hertzian non-adhesive frictionless contact theory. Virtual experiments were setup with a point-based deformable block and a rigid indenter, and force-displacement curves obtained from the virtual experiments were compared to the theoretical solutions. The meshless mechanics model of soft tissue and the integrated novel discontinuity treatment technique discussed in this dissertation allows handling cuts of arbitrary shape. The implemented enrichment technique not only modifies the internal mechanics of the soft tissue model, but also updates the point-based visual representation in an efficient way preventing the use of costly dynamic remeshing operations