This diploma thesis follows visualization of snow formations, which are called penitentes. This work includes also collecting the data needed to derive the optical properties of the penitentes material. Which are different phases between snow and ice. For visualization method is used Progressive Transient Photon Beams, that this work implements with the help of SmallUbpb.

Computing complex lighting simulations such as global illumination is a computationally intensive task. Various real time solutions exist to approximate aspects of global illumination such as shadows, however, few of these methods offer single pass rendering solutions for soft shadows (self and other) and inter-reflections. In contrast, Precomputed Radiance Transfer (PRT) is a real-time computer graphics technique which pre-calculates an object's response to potential incident light. At run time, the actual incident light can be used to quickly illuminate the surface, rendering effects such as soft self-shadows and inter-reflections. In this thesis, we show that by calculating PRT lighting coefficients densely over a surface as texture data, additional surface detail can be encoded by integrating other computer graphics techniques, such as normal mapping. By calculating transfer coefficients densely over the surface of a mesh as texture data, greater fidelity can be achieved in lighting coarse meshes than simple interpolation can achieve. Furthermore, the lighting on low polygon objects can be enhanced by drawing surface normal and occlusion data from highly tessellated, detailed meshes. By applying such data to a decimated, simplified mesh, a more detailed and visually pleasing reconstruction can be displayed for a lower cost. In addition, this thesis introduces Hierarchical PRT, which extends some surface effects, such as soft shadows, between objects. Previous approaches to PRT used a more complex neighborhood transfer scheme in order to extend these lighting effects. Hierarchical PRT attempts to capture scene information in a tree data structure which represents coarse lighting relationships between objects. Potential occlusions can be found at run time by utilizing the same spherical harmonic representation used to represent surface lighting to instead store light "filters" between scene tree nodes. Such "filters" can be combined over a set of nodes in the scene to obtain the net shadowing of an object with good performance. We present both visually pleasing results on simplified meshes using normal mapping and textured PRT and initial results using Hierarchical PRT that captures low frequency lighting information for a small number of dynamic objects which shadow static scene objects with good results.

This Diploma thesis deals with problems of making 3D e-shops for their widely usage. It contains the description of current level of e-shop, theoretical solution of the problem of transition to 3D with a description of advantages, disadvantages and warrant of new solution. It contains the practical solution as well.

This diploma thesis deals with the possibilities of using 3D modeling in electronic commerce. It describes the theoretical basis and methods of 3D modeling, which is used. Includes description of the current state in electronic presentation, the description of the advantages and disadvantages these procedures, as well as practical implementation of 3D model.

Disertační práce se zabývá lokalizací zdrojů zvuku a akustickým zoomem. Hlavním cílem této práce je navrhnout systém s akustickým zoomem, který přiblíží zvuk jednoho mluvčího mezi skupinou mluvčích, a to i když mluví současně. Tento systém je kompatibilní s technikou prostorového zvuku. Hlavní přínosy disertační práce jsou následující: 1. Návrh metody pro odhad více směrů přicházejícího zvuku. 2. Návrh metody pro akustické zoomování pomocí DirAC. 3. Návrh kombinovaného systému pomocí předchozích kroků, který může být použit v telekonferencích.

The main purpose of this paper is to provide a detailed analysis of some of the major available open source rendering libraries with the emphasis on their notable characteristics, and an in-depth comparison among them with regards to their possible practical use. Specifically, the selected rendering libraries in this paper are the following - OpenSceneGraph, Ogre 3D, Irrlicht Engine, Crystal Space and OpenSG, but a sidenote is given to some of the others as well. Last but not least, self-made examples of their usage are also included, and are meant to demonstrate some of the mentioned characteristics and principles of the analysed libraries.

The purpose of this diploma thesis is to analyze possibilities of non-photorealistic rendering focused on area of image transformation and afterwards design algorithm for video postprocessing to it's cartoon representation. The thesis describes problem analysis, design of the algorithm and it's implementation.

Master thesis is dealing with design and implementation of ray-tracing and path-tracing using IPP library. Theoretical part discusses current trends in acceleration of selected algorithms and also possibilities of parallelization. Design of ray-tracing and path-tracing algorithm and form of parallelization are described in proposal. This part also discusses implementation of adaptive sampling and importance sampling with Monte Carlo method to accelerate path-tracing algorithm. Next part is dealing with particular steps in implementation of selected rendering methods regarding IPP library. Implementation of network interface using Boost library is also discussed. At the end, implemented methods are subjected to performance and quality test. Final product of this thesis is server aplication capable of handling multiple connections which provides visualisation and client application which implements ray-tracing and path-tracing.

This paper deals with rendering of automobiles with use of WebGL technology. Aim of this paper is proposal and implementation of method for realistic and stylized rendering of 3D models of automobiles for internal use as a simple preview of automobile in development and presentation or for use in infotainment systems directly in automobiles. Part of this paper is implementation and outline of reachable options and properties of such implementation. This paper is created in cooperation with company SKODA AUTO a.s.

Les ombres sont un élément fondamental pour garantir le réalisme des images de synthèses. Elles donnent des informations nécessaires pour discerner correctement le positionnement relatif des objets. Le calcul d'ombre dures exactes en temps-réel reste toutefois un problème difficile en Informatique Graphique. Les Shadow Maps sont privilégiées pour leurs excellentes performances, mais elles ne peuvent garantir un résultat exact par pixel. Les volumes d'ombre sont plus lents que les Shadow Maps mais produisent des ombres exactes en toute circonstances. Bien qu'ils aient récemment atteint un haut niveau de performances, ils restent sensibles à la complexité géométrique et sont limités à des scènes de taille modeste. Dans cette thèse, nous proposons un nouvel algorithme de rendu d'ombres dures en temps réel basé sur les volumes d'ombre qui reste rapide sur des scènes de très grande tailles. De plus, nous introduisons une nouvelle stratégie de partitionnement jusque-là inexplorée en Informatique Graphique : les arbres métriques. / Shadows are a fundamental visual effect for computer generated images. They provide essential spatial hints allowing us to correctly perceive objects positions in the scene. Despite its importance, computing pixel accurate shadows in real-time is a challenging problem in Computer Graphics. Shadow Maps are still the favored solution due to their high efficiency, but they can't always provide pixel accurate results. Shadow Volumes are slower than Shadow Maps but always garantee pixel accurate shadows. While recent works significantly improved their performance, they remain sensitive to scalability, which limits their application scope. In this thesis, we propose a new algorithm based on Shadow Volumes that remains fast even on very large scenes. Furthermore, we introduce a new partitioning strategy that is yet unexplored in Computer Graphics : the metric tree.