|
|
Hierarchical Techniques in Lighting Computation
Ligmajer, Jiří ; Polok, Lukáš (referee) ; Navrátil, Jan (advisor)
This master thesis deals with description of hierarchical techniques in global lighting computation. Here is explaining the importance of hierarchical techniques in lighting computation and shows method, how to use these hierarchical techniques in realtime radiosity and its extension to dynamic area lighting. These two techniques are described in detail in the first part of this project. In the other part is desing and implementation of application for dynamic area lighting computation.
|
|
|
Voxel Cone Tracing
Pracuch, Michal ; Tóth, Michal (referee) ; Milet, Tomáš (advisor)
This thesis deals with the global illumination in the scene by using Voxel Cone Tracing method. It is based on the voxelization of a triangle mesh scene. The voxels can be stored to a full regular 3D grid (texture) or to the hierarchic Sparse Voxel Octree for saving of the memory space. This voxel representation is further used for computations of the global indirect illumination in real time within normal triangle mesh scenes for more realistic final image. Values from the voxels are obtained by tracing cones from the pixels which we want to get illumination for.
|
|
|
Vegetation Rendering
Kliš, Michal ; Matýšek, Michal (referee) ; Starka, Tomáš (advisor)
The aim of this work is the design and implementation of algorithms to simplify complex polygonal models of vegetation so that it is possible to display these models in large numbers, without excessive loss of their visual appearance. The work specifically deals with both the modeling of already minimalist plant models and algorithms for their final simplification. Specifically, these algorithms include the method of converting a polygonal model to a volume map and converting the model to plates. In addition to simplifying the models, the work also deals with their display in real time and lighting.
|
|
|
Acceleration Structure Building on GPU
Hába, Jiří ; Kula, Michal (referee) ; Starka, Tomáš (advisor)
This thesis focuses on the construction of octree for three-dimensional triangular models on graphics hardware. This acceleration structure was chosen based on a comparison of the most commonly used acceleration structures. The approach to the construction of this structure is based on the method of construction of a sparse voxel octree which is derived from the former. The process uses voxelization accelerated by the graphics card's rendering pipeline. To facilitate this process and enable the integration of the proposed procedure into future applications, this thesis also includes design of a C++ language library.
|
|
|
Visualization of SDF Based Scenes
Fusek, Petr ; Karas, Matej (referee) ; Milet, Tomáš (advisor)
Pole znaménkových vzdáleností (Signed Distance Fields, SDF) poskytuje alternativní metodu popisu 3D povrchů. Povrch je reprezentován funkcí SDF, která vrací vzdálenost k nejbližšímu bodu povrchu. Tyto funkce mohou být kombinovány pomocí technik podobných konstrukční geometrii pevných těles (Constructive Solid Geometry, CSG). Nicméně, algoritmy vrhání paprsků (ray-casting), které se běžně používají pro vizualizaci těchto modelů, nejsou dostatečně škálovatelné pro vykreslování velkých a složitých scén s mnoha SDF objekty v reálném čase. Tato práce, inspirovaná hrou Dreams a technologií GigaVoxel, představuje datovou strukturu pro reprezentaci a vytváření 3D modelů pomocí zmíněné SDF-CSG metody spolu s technikou vykreslování v reálném čase schopnou vykreslovat scény s velkým počtem těchto objektů pomocí datové struktury Sparse Voxel Octree (SVO), vyhodnocované na GPU v reálném čase. Vykreslování využívá techniky úrovně detailu (Level Of Detail, LOD) a algoritmus ořezávání podle viditelnosti (view frustum culling) k výběru viditelných SDF bloků s úrovní detailů úměrnou vzdálenosti od kamery. Aplikace vyvinutá v jazyce Rust s využitím grafického API wgpu umožňuje vytvářet tyto SDF modely a demonstruje představené vykreslovaní techniky. Tato aplikace by mohla sloužit základ pro budoucí vývoj jednoduchého 3D nástroje pro umělce, kteří hledají alternativu tradičního polygonálního modelování.
|
|
|
Vegetation Rendering
Kliš, Michal ; Matýšek, Michal (referee) ; Starka, Tomáš (advisor)
The aim of this work is the design and implementation of algorithms to simplify complex polygonal models of vegetation so that it is possible to display these models in large numbers, without excessive loss of their visual appearance. The work specifically deals with both the modeling of already minimalist plant models and algorithms for their final simplification. Specifically, these algorithms include the method of converting a polygonal model to a volume map and converting the model to plates. In addition to simplifying the models, the work also deals with their display in real time and lighting.
|
|
|
Acceleration Structure Building on GPU
Hába, Jiří ; Kula, Michal (referee) ; Starka, Tomáš (advisor)
This thesis focuses on the construction of octree for three-dimensional triangular models on graphics hardware. This acceleration structure was chosen based on a comparison of the most commonly used acceleration structures. The approach to the construction of this structure is based on the method of construction of a sparse voxel octree which is derived from the former. The process uses voxelization accelerated by the graphics card's rendering pipeline. To facilitate this process and enable the integration of the proposed procedure into future applications, this thesis also includes design of a C++ language library.
|
|
|
Voxel Cone Tracing
Pracuch, Michal ; Tóth, Michal (referee) ; Milet, Tomáš (advisor)
This thesis deals with the global illumination in the scene by using Voxel Cone Tracing method. It is based on the voxelization of a triangle mesh scene. The voxels can be stored to a full regular 3D grid (texture) or to the hierarchic Sparse Voxel Octree for saving of the memory space. This voxel representation is further used for computations of the global indirect illumination in real time within normal triangle mesh scenes for more realistic final image. Values from the voxels are obtained by tracing cones from the pixels which we want to get illumination for.
|
|
|
Hierarchical Techniques in Lighting Computation
Ligmajer, Jiří ; Polok, Lukáš (referee) ; Navrátil, Jan (advisor)
This master thesis deals with description of hierarchical techniques in global lighting computation. Here is explaining the importance of hierarchical techniques in lighting computation and shows method, how to use these hierarchical techniques in realtime radiosity and its extension to dynamic area lighting. These two techniques are described in detail in the first part of this project. In the other part is desing and implementation of application for dynamic area lighting computation.
|
guest ::
