93 results
Search Results
Now showing 1 - 10 of 93
Item Extracting Microfacet-based BRDF Parameters from Arbitrary Materials with Power Iterations(The Eurographics Association and John Wiley & Sons Ltd., 2015) Dupuy, Jonathan; Heitz, Eric; Iehl, Jean-Claude; Poulin, Pierre; Ostromoukhov, Victor; Jaakko Lehtinen and Derek NowrouzezahraiWe introduce a novel fitting procedure that takes as input an arbitrary material, possibly anisotropic, and automatically converts it to a microfacet BRDF. Our algorithm is based on the property that the distribution of microfacets may be retrieved by solving an eigenvector problem that is built solely from backscattering samples. We show that the eigenvector associated to the largest eigenvalue is always the only solution to this problem, and compute it using the power iteration method. This approach is straightforward to implement, much faster to compute, and considerably more robust than solutions based on nonlinear optimizations. In addition, we provide simple conversion procedures of our fits into both Beckmann and GGX roughness parameters, and discuss the advantages of microfacet slope space to make our fits editable. We apply our method to measured materials from two large databases that include anisotropic materials, and demonstrate the benefits of spatially varying roughness on texture mapped geometric models.Item Real-time Inextensible Hair with Volume and Shape(The Eurographics Association, 2015) Sánchez-Banderas, Rosa María; Barreiro, Héctor; García-Fernández, Ignacio; Pérez, Mariano; Mateu Sbert and Jorge Lopez-MorenoHair simulation is a common topic extensively studied in computer graphics. One of the many challenges in this field is simulating realistic hair in a real-time environment. In this paper, we propose a unified simulation scheme to consider three of the key features in hair simulation; inextensibility, shape preservation and hair-hair interaction. We use an extension to the Dynamic Follow the Leader (DFTL) method to include shape preservation. Our implementation is also coupled with a Lagrangian approach to address the hair-hair interaction dynamics. A GPU-friendly scheme is proposed that is able to exploit the massive parallelism these devices offer, being able to simulate thousands of strands in real-time. The method has been integrated in a game development platform with a shading model for rendering and several test applications have been developed using this implementation.Item Virtual Spherical Gaussian Lights for Real-time Glossy Indirect Illumination(The Eurographics Association and John Wiley & Sons Ltd., 2015) Tokuyoshi, Yusuke; Stam, Jos and Mitra, Niloy J. and Xu, KunVirtual point lights (VPLs) are well established for real-time global illumination. However, this method suffers from spiky artifacts and flickering caused by singularities of VPLs, highly glossy materials, high-frequency textures, and discontinuous geometries. To avoid these artifacts, this paper introduces a virtual spherical Gaussian light (VSGL) which roughly represents a set of VPLs. For a VSGL, the total radiant intensity and positional distribution of VPLs are approximated using spherical Gaussians and a Gaussian distribution, respectively. Since this approximation can be computed using summations of VPL parameters, VSGLs can be dynamically generated using mipmapped reflective shadow maps. Our VSGL generation is simple and independent from any scene geometries. In addition, reflected radiance for a VSGL is calculated using an analytic formula. Hence, we are able to render one-bounce glossy interreflections at real-time frame rates with smaller artifacts.Item Brownian Dynamics Simulation on the GPU: Virtual Colloidal Suspensions(The Eurographics Association, 2015) Tran, Công Tâm; Crespin, Benoît; Cerbelaud, Manuella; Videcoq, Arnaud; Fabrice Jaillet and Florence Zara and Gabriel ZachmannBrownian Dynamics simulations are frequently used to describe and study the motion and aggregation of colloidal particles, in the field of soft matter and material science. In this paper, we focus on the problem of neighbourhood search to accelerate computations on a single GPU. Our approach for one kind of particle outperforms existing implementations by introducing a novel dynamic test. For bimodal size distributions we also introduce a new algorithm that separates computations for large and small particles, in order to avoid additional friction that is known to restrict diffusive displacements.Item Improved Half Vector Space Light Transport(The Eurographics Association and John Wiley & Sons Ltd., 2015) Hanika, Johannes; Kaplanyan, Anton; Dachsbacher, Carsten; Jaakko Lehtinen and Derek NowrouzezahraiIn this paper, we present improvements to half vector space light transport (HSLT) [KHD14], which make this approach more practical, robust for difficult input geometry, and faster. Our first contribution is the computation of half vector space ray differentials in a different domain than the original work. This enables a more uniform stratification over the image plane during Markov chain exploration. Furthermore, we introduce a new multi chain perturbation in half vector space, which, if combined appropriately with half vector perturbation, makes the mutation strategy both more robust to geometric configurations with fine displacements and faster due to reduced number of ray casts. We provide and analyze the results of improved HSLT and discuss possible applications of our new half vector ray differentials.Item A Virtual and Augmented Reality Course Based on Inexpensive Interaction Devices and Displays(The Eurographics Association, 2015) Santos, Beatriz Sousa; Dias, Paulo; Madeira, Joaquim; M. Bronstein and M. TeschnerIn the last years a plethora of affordable displays, sensors, and interaction devices has reached the market, fostering the application of Virtual and Augmented Reality to many new situations. Yet, creating such applications requires a good understanding of the field and specific technical skills typically not provided by current Computer Science and Engineering education. This paper presents a graduate level course offered to MSc. Programs in Computer and Electrical Engineering which introduces the main concepts, techniques and tools in Virtual and Augmented Reality. The aim is to provide students with enough background to understand, design, implement and test such applications. The course organization, the main issues addressed and bibliography, the sensors, interaction devices and displays used, and a sample of the practical projects are briefly described. Major issues are discussed and conclusions are drawn.Item Fast Robust and Precise Shadow Algorithm for WebGL 1.0 Platform(The Eurographics Association, 2015) Milet, Tomáš; Tóth, Michal; Pečiva, Jan; Starka, Tomáš; Kobrtek, Jozef; Zemcik, Pavel; Masataka Imura and Pablo Figueroa and Betty MohlerThis paper presents fast and robust per-sample correct shadows for WebGL platform. The algorithm is based on silhouette shadow volumes and it rivals the standard shadow mapping performance. Our performance is usually superior when compared with high resolution shadow maps. Moreover, it does not suffer from a number of artefacts of shadow mapping and always provides per-pixel correct results. WebGL 1.0 provides just vertex and fragment shaders. Thus, we put all our algorithms evaluating silhouette edges to vertex shaders. Specially precomputed data are fed to the vertex shaders that extrude shadow volume sides just for silhouette edges. Some optimizations are deployed for performance and data size reasons that are important especially on low performance configurations, such as cost-effective tablets and mobile phones. The paper evaluates our solution on number of models. Our solution performs on par with high resolution omnidirectional shadow mapping.Item Natural Phenomena as Metaphors for Visualization of Trend Data in Interactive Software Maps(The Eurographics Association, 2015) Würfel, Hannes; Trapp, Matthias; Limberger, Daniel; Döllner, Jürgen; Rita Borgo and Cagatay TurkaySoftware maps are a commonly used tool for code quality monitoring in software-development projects and decision making processes. While providing an important visualization technique for the hierarchical system structure of a single software revision, they lack capabilities with respect to the visualization of changes over multiple revisions. This paper presents a novel technique for visualizing the evolution of the software system structure based on software metric trends. These trend maps extend software maps by using real-time rendering techniques for natural phenomena yielding additional visual variables that can be effectively used for the communication of changes. Therefore, trend data is automatically computed by hierarchically aggregating software metrics. We demonstrate and discuss the presented technique using two real world data sets of complex software systems.Item Path-space Motion Estimation and Decomposition for Robust Animation Filtering(The Eurographics Association and John Wiley & Sons Ltd., 2015) Zimmer, Henning; Rousselle, Fabrice; Jakob, Wenzel; Wang, Oliver; Adler, David; Jarosz, Wojciech; Sorkine-Hornung, Olga; Sorkine-Hornung, Alexander; Jaakko Lehtinen and Derek NowrouzezahraiRenderings of animation sequences with physics-based Monte Carlo light transport simulations are exceedingly costly to generate frame-by-frame, yet much of this computation is highly redundant due to the strong coherence in space, time and among samples. A promising approach pursued in prior work entails subsampling the sequence in space, time, and number of samples, followed by image-based spatio-temporal upsampling and denoising. These methods can provide significant performance gains, though major issues remain: firstly, in a multiple scattering simulation, the final pixel color is the composite of many different light transport phenomena, and this conflicting information causes artifacts in image-based methods. Secondly, motion vectors are needed to establish correspondence between the pixels in different frames, but it is unclear how to obtain them for most kinds of light paths (e.g. an object seen through a curved glass panel). To reduce these ambiguities, we propose a general decomposition framework, where the final pixel color is separated into components corresponding to disjoint subsets of the space of light paths. Each component is accompanied by motion vectors and other auxiliary features such as reflectance and surface normals. The motion vectors of specular paths are computed using a temporal extension of manifold exploration and the remaining components use a specialized variant of optical flow. Our experiments show that this decomposition leads to significant improvements in three image-based applications: denoising, spatial upsampling, and temporal interpolation.Item Memory-Efficient On-The-Fly Voxelization of Particle Data(The Eurographics Association, 2015) Zirr, Tobias; Dachsbacher, Carsten; C. Dachsbacher and P. NavrátilIn this paper we present a novel GPU-friendly real-time voxelization technique for rendering homogeneous media that is defined by particles, e.g. fluids obtained from particle-based simulations such as Smoothed Particle Hydrodynamics (SPH). Our method computes view-adaptive binary voxelizations with on-the-fly compression of a tiled perspective voxel grid, achieving higher resolutions than previous approaches. It allows for interactive generation of realistic images, enabling advanced rendering techniques such as ray casting-based refraction and reflection, light scattering and absorption, and ambient occlusion. In contrast to previous methods, it does not rely on preprocessing such as expensive, and often coarse, scalar field conversion or mesh generation steps. Our method directly takes unsorted particle data as input. It can be further accelerated by identifying fully populated simulation cells during simulation. The extracted surface can be filtered to achieve smooth surface appearance.