|
Shadow Volumes in OpenGL
Salvet, Jan ; Pečiva, Jan (referee) ; Havel, Jiří (advisor)
This thesis is focused on one particular method of shadowing in computer graphics. It not only describes basic theory, but also deals with actual implementation using modern OpenGL. It includes performance tests of several versions of this method using a testing application. The results show clear advantage of computing shadows on graphics card.
|
|
Graphics Intro 64kB Using OpenGL
Juránková, Markéta ; Havel, Jiří (referee) ; Herout, Adam (advisor)
The aim of the master's thesis is to create a graphic intro with the limited size of 64kB. Brief history of a demoscene and the graphics library OpenGL is introduced in the following text. The main part of the work is a description of minimal graphics techniques used in a creative process and their further application in the final programme.
|
| |
| |
|
Static Analysis of Java Programs
Vyvial, Pavel ; Hýsek, Jiří (referee) ; Křena, Bohuslav (advisor)
The project SHADOWS has started research which is developing software for automatic bug healing. We work with self-healing software, which looks for concurrent bugs. If the~detection software finds a bug, the healing action will be performed. After every healing action, one would like to know whether this action has fixed the detected problem and, perhaps even more importantly, that it has not caused any other, possibly even more serious, problem. Therefore this paper describes a technique which gives the answer for this question after automatical healing. One can fix some concurent bugs by adding healing locks. One does healing assurance by searching monitorenter instruction and uses Control Flow Graph analysis over Java byte-code. The prototype uses static analysis (tool FindBugs) for this purpose.
|
|
Shadow Rendering from Omnidirectional Light Sources
Mikulica, Tomáš ; Kobrtek, Jozef (referee) ; Navrátil, Jan (advisor)
This work discusses the possibilities for shadow rendering from omnidirectional light sources using OpenGL library. In this work the Cube map shadow mapping and the Dual paraboloid shadow mapping algorithms are described. Further more, this work contains the results of a comparison of these two methods in a way of time required for shadow map creation and a comparison of visual quality of resulting shadows.
|
|
Techniques of Real-Time Shadow Rendering
Kudlač, Boris ; Španěl, Michal (referee) ; Herout, Adam (advisor)
The goal of this work is to create complete overview about existing techniques for real-time shadow computation in computer graphics. It describes theory of each technique and it's algorithm, as well as implementation details and practical usage. It completely informs about each technique features, problems, extensions, advantages and disadvantages for different situations and asks a question, if there is one all-solving shadow technique suitable for all purposes. In the end, the thesis compares all the techniques in their features, limitations and hardware usage.
|
|
Volumetric Efects Accelerated on GPU
Kubovčík, Tomáš ; Tóth, Michal (referee) ; Starka, Tomáš (advisor)
This thesis deals with simulation and rendering of fluid based volumetric effects, especially effect of fire and smoke. Computations are accelerated on graphics card using modern graphics API with motivation to achieve realistic visual results as well as physically correct calculations. Implemented volumetric effects are distributed as dynamic library which allows addition of these effects to existing applications.
|
|
Fast Visualization of Precise Shadows Using Precomputed Scene Geometry
Mikeš, Tibor ; Milet, Tomáš (referee) ; Pečiva, Jan (advisor)
The aim of this bachelor's thesis is to design and implement an effective method of rendering per-pixel correct hard shadows in scenes with static geometry. The principle of the method is in separate rendering of shadowed and lit surfaces. Whether a triangle is in shadow or not is known prior to its rasterization, which allows the renderer to omit per-fragment shadow calculations. Rendering a scene in this way requires it to be preprocessed. Therefore, two possible ways of preprocessing the scenes are described and implemented as well.
|
| |