Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Jaroslav Křivánek is active.

Publication


Featured researches published by Jaroslav Křivánek.


Computer Graphics Forum | 2009

Hydraulic Erosion Using Smoothed Particle Hydrodynamics

P. Krištof; Bedrich Benes; Jaroslav Křivánek; Ondrej Stava

This paper presents a new technique for modification of 3D terrains by hydraulic erosion. It efficiently couples fluid simulation using a Lagrangian approach, namely the Smoothed Particle Hydrodynamics (SPH) method, and a physically‐based erosion model adopted from an Eulerian approach. The eroded sediment is associated with the SPH particles and is advected both implicitly, due to the particle motion, and explicitly, through an additional velocity field, which accounts for the sediment transfer between the particles. We propose a new donor‐acceptor scheme for the explicit advection in SPH. Boundary particles associated to the terrain are used to mediate sediment exchange between the SPH particles and the terrain itself. Our results show that this particle‐based method is efficient for the erosion of dense, large, and sparse fluid. Our implementation provides interactive results for scenes with up to 25,000 particles.


international conference on computer graphics and interactive techniques | 2012

Light transport simulation with vertex connection and merging

Iliyan Georgiev; Jaroslav Křivánek; Tomáš Davidovič; Philipp Slusallek

Developing robust light transport simulation algorithms that are capable of dealing with arbitrary input scenes remains an elusive challenge. Although efficient global illumination algorithms exist, an acceptable approximation error in a reasonable amount of time is usually only achieved for specific types of input scenes. To address this problem, we present a reformulation of photon mapping as a bidirectional path sampling technique for Monte Carlo light transport simulation. The benefit of our new formulation is twofold. First, it makes it possible, for the first time, to explain in a formal manner the relative efficiency of photon mapping and bidirectional path tracing, which have so far been considered conceptually incompatible solutions to the light transport problem. Second, it allows for a seamless integration of the two methods into a more robust combined rendering algorithm via multiple importance sampling. A progressive version of this algorithm is consistent and efficiently handles a wide variety of lighting conditions, ranging from direct illumination, diffuse and glossy inter-reflections, to specular-diffuse-specular light transport. Our analysis shows that this algorithm inherits the high asymptotic performance from bidirectional path tracing for most light path types, while benefiting from the efficiency of photon mapping for specular-diffuse-specular lighting effects.


symposium on computer animation | 2008

Interactive terrain modeling using hydraulic erosion

Ondřej Št'ava; Bedřich Beneš; Matthew Brisbin; Jaroslav Křivánek

We present a step toward interactive physics-based modeling of terrains. A terrain, composed of layers of materials, is edited with interactive modeling tools built upon different physics-based erosion and deposition algorithms. First, two hydraulic erosion algorithms for running water are coupled. Areas where the motion is slow become more eroded by the dissolution erosion, whereas in the areas with faster motion, the force-based erosion prevails. Second, when the water under-erodes certain areas, slippage takes effect and the river banks fall into the water. A variety of local and global editing operation is provided. The user has a great level of control over the process and receives immediate feedback since the GPU-based erosion simulation runs at least at 20 fps on off-the-shelf computers for scenes with grid resolution of 2048 x 1024 and four layers of material. We also present a divide and conquer approach to handle large terrain erosion, where the terrain is tiled, and each tile calculated independently on the GPU. We show a wide variety of erosion-based modeling features such as forming rivers, drying flooded areas, rain, interactive manipulation with rivers, spring, adding obstacles into the water, etc.


eurographics | 2014

Scalable Realistic Rendering with Many-Light Methods

Carsten Dachsbacher; Jaroslav Křivánek; Miloš Hašan; Adam Arbree; Bruce Walter; Jan Novák

Recent years have seen increasing attention and significant progress in many‐light rendering, a class of methods for efficient computation of global illumination. The many‐light formulation offers a unified mathematical framework for the problem reducing the full lighting transport simulation to the calculation of the direct illumination from many virtual light sources. These methods are unrivaled in their scalability: they are able to produce plausible images in a fraction of a second but also converge to the full solution over time. In this state‐of‐the‐art report, we give an easy‐to‐follow, introductory tutorial of the many‐light theory; provide a comprehensive, unified survey of the topic with a comparison of the main algorithms; discuss limitations regarding materials and light transport phenomena and present a vision to motivate and guide future research. We will cover both the fundamental concepts as well as improvements, extensions and applications of many‐light rendering.


international conference on computer graphics and interactive techniques | 2009

Virtual spherical lights for many-light rendering of glossy scenes

Miloš Hašan; Jaroslav Křivánek; Bruce Walter; Kavita Bala

In this paper, we aim to lift the accuracy limitations of many-light algorithms by introducing a new light type, the virtual spherical light (VSL). The illumination contribution of a VSL is computed over a non-zero solid angle, thus eliminating the illumination spikes that virtual point lights used in traditional many-light methods are notorious for. The VSL enables application of many-light approaches in scenes with glossy materials and complex illumination that could previously be rendered only by much slower algorithms. By combining VSLs with the matrix row-column sampling algorithm, we achieve high-quality images in one to four minutes, even in scenes where path tracing or photon mapping take hours to converge.


international conference on computer graphics and interactive techniques | 2010

Effects of global illumination approximations on material appearance

Jaroslav Křivánek; James A. Ferwerda; Kavita Bala

Rendering applications in design, manufacturing, ecommerce and other fields are used to simulate the appearance of objects and scenes. Fidelity with respect to appearance is often critical, and calculating global illumination (GI) is an important contributor to image fidelity; but it is expensive to compute. GI approximation methods, such as virtual point light (VPL) algorithms, are efficient, but they can induce image artifacts and distortions of object appearance. In this paper we systematically study the perceptual effects on image quality and material appearance of global illumination approximations made by VPL algorithms. In a series of psychophysical experiments we investigate the relationships between rendering parameters, object properties and image fidelity in a VPL renderer. Using the results of these experiments we analyze how VPL counts and energy clamping levels affect the visibility of image artifacts and distortions of material appearance, and show how object geometry and material properties modulate these effects. We find the ranges of these parameters that produce VPL renderings that are visually equivalent to reference renderings. Further we identify classes of shapes and materials that cannot be accurately rendered using VPL methods with limited resources. Using these findings we propose simple heuristics to guide visually equivalent and efficient rendering, and present a method for correcting energy losses in VPL renderings. This work provides a strong perceptual foundation for a popular and efficient class of GI algorithms.


international conference on computer graphics and interactive techniques | 2014

Unifying points, beams, and paths in volumetric light transport simulation

Jaroslav Křivánek; Iliyan Georgiev; Toshiya Hachisuka; Petr Vévoda; Martin Šik; Derek Nowrouzezahrai; Wojciech Jarosz

Efficiently computing light transport in participating media in a manner that is robust to variations in media density, scattering albedo, and anisotropy is a difficult and important problem in realistic image synthesis. While many specialized rendering techniques can efficiently resolve subsets of transport in specific media, no single approach can robustly handle all types of effects. To address this problem we unify volumetric density estimation, using point and beam estimators, and Monte Carlo solutions to the path integral formulation of the rendering and radiative transport equations. We extend multiple importance sampling to correctly handle combinations of these fundamentally different classes of estimators. This, in turn, allows us to develop a single rendering algorithm that correctly combines the benefits and mediates the limitations of these powerful volume rendering techniques.


international conference on computer graphics and interactive techniques | 2014

On-line learning of parametric mixture models for light transport simulation

Jiří Vorba; Ondřej Karlík; Martin Šik; Tobias Ritschel; Jaroslav Křivánek

Monte Carlo techniques for light transport simulation rely on importance sampling when constructing light transport paths. Previous work has shown that suitable sampling distributions can be recovered from particles distributed in the scene prior to rendering. We propose to represent the distributions by a parametric mixture model trained in an on-line (i.e. progressive) manner from a potentially infinite stream of particles. This enables recovering good sampling distributions in scenes with complex lighting, where the necessary number of particles may exceed available memory. Using these distributions for sampling scattering directions and light emission significantly improves the performance of state-of-the-art light transport simulation algorithms when dealing with complex lighting.


international conference on computer graphics and interactive techniques | 2010

An anisotropic BRDF model for fitting and Monte Carlo rendering

Murat Kurt; László Szirmay-Kalos; Jaroslav Křivánek

In this paper we propose a new physically plausible, anisotropic Bidirectional Reflectance Distribution Function (BRDF) for fitting and for importance sampling in global illumination rendering. We demonstrate that the new model is better in data fitting than existing BRDF models. We also describe efficient schemes for sampling the proposed anisotropic BRDF model. Furthermore, we test it on a GPU-based real-time rendering algorithm and show that material design can be done with this anisotropic BRDF model effectively. We also show that the new model has effective real-time rendering performance.


international conference on computer graphics and interactive techniques | 2013

Joint importance sampling of low-order volumetric scattering

Iliyan Georgiev; Jaroslav Křivánek; Toshiya Hachisuka; Derek Nowrouzezahrai; Wojciech Jarosz

Central to all Monte Carlo-based rendering algorithms is the construction of light transport paths from the light sources to the eye. Existing rendering approaches sample path vertices incrementally when constructing these light transport paths. The resulting probability density is thus a product of the conditional densities of each local sampling step, constructed without explicit control over the form of the final joint distribution of the complete path. We analyze why current incremental construction schemes often lead to high variance in the presence of participating media, and reveal that such approaches are an unnecessary legacy inherited from traditional surface-based rendering algorithms. We devise joint importance sampling of path vertices in participating media to construct paths that explicitly account for the product of all scattering and geometry terms along a sequence of vertices instead of just locally at a single vertex. This leads to a number of practical importance sampling routines to explicitly construct single-and double-scattering subpaths in anisotropically-scattering media. We demonstrate the benefit of our new sampling techniques, integrating them into several path-based rendering algorithms such as path tracing, bidirectional path tracing, and many-light methods. We also use our sampling routines to generalize deterministic shadow connections to connection subpaths consisting of two or three random decisions, to efficiently simulate higher-order multiple scattering. Our algorithms significantly reduce noise and increase performance in renderings with both isotropic and highly anisotropic, low-order scattering.

Collaboration


Dive into the Jaroslav Křivánek's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

Sumanta N. Pattanaik

University of Central Florida

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Martin Šik

Charles University in Prague

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Pascal Gautron

University of Central Florida

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Alexander Wilkie

Charles University in Prague

View shared research outputs
Researchain Logo
Decentralizing Knowledge