|
|
Graphics Intro 64kB Using OpenGL
Peňáz, Martin ; Tóth, Michal (referee) ; Milet, Tomáš (advisor)
This bachelor’s thesis deals with the solution of graphics intro with limited size of 64kB. The work describes methods used for creation of graphics intro. It deals with procedural generation, compiler settings and final compression by exe packer application.
|
|
|
Proposal of 3D Electronic Catologue
Špaček, Ondřej ; Dvořák,, Jiří (referee) ; Dvořák, Jiří (advisor)
This Bachelor's thesis deals proposal of 3D electronic catalogue solution of private company. The work affords theoretic base of 3D modeling and methods 3D modeling uses. There is account of some options for display 3D graphics by 2D display devices. The work describes basic axiom of HTML, CSS and PHP languages too.
|
|
|
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í.
|
|
|
CSG modeling for polygonal objects
Václavík, Jiří ; Křivánek, Jaroslav (advisor) ; Beneš, Jan (referee)
This work deals with an efficient and robust technique of performing Boolean operations on polygonal models. Full robustness is achieved within an internal representation based on planes and BSP (binary space partitioning) trees, in which operations can be carried out exactly in mere fixed precision arithmetic. Necessary conversions from the usual representation to the inner one and back, including their consequences are analyzed in detail. The performance of the method is optimized by a localization scheme in the form of an adaptive octree. The resulting implementation RazeCSG is experimentally compared with implementations used in practice Carve and Maya, which are not fully robust. For large models, RazeCSG shows only twice lower performance in the worst case than Carve, and is at least 130 times faster than Maya.
|
|
|
CSG modeling for polygonal objects
Václavík, Jiří ; Křivánek, Jaroslav (advisor) ; Beneš, Jan (referee)
This work deals with an efficient and robust technique of performing Boolean operations on polygonal models. Full robustness is achieved within an internal representation based on planes and BSP (binary space partitioning) trees, in which operations can be carried out exactly in mere fixed precision arithmetic. Necessary conversions from the usual representation to the inner one and back, including their consequences are analyzed in detail. The performance of the method is optimized by a localization scheme in the form of an adaptive octree. The resulting implementation RazeCSG is experimentally compared with implementations used in practice Carve and Maya, which are not fully robust. For large models, RazeCSG shows only twice lower performance in the worst case than Carve, and is at least 130 times faster than Maya.
|
|
|
Proposal of 3D Electronic Catologue
Špaček, Ondřej ; Dvořák,, Jiří (referee) ; Dvořák, Jiří (advisor)
This Bachelor's thesis deals proposal of 3D electronic catalogue solution of private company. The work affords theoretic base of 3D modeling and methods 3D modeling uses. There is account of some options for display 3D graphics by 2D display devices. The work describes basic axiom of HTML, CSS and PHP languages too.
|
|
|
Rendering Chess Using Ray Tracing
Vaverka, Martin ; Jošth, Radovan (referee) ; Herout, Adam (advisor)
This work aims at rendering 3D scene using ray tracing. It describes advantages and disadvantages of this technology and its alternation known as distributed ray tracing. Other part deals with method from different branch, which are closely related to distributed ray tracing - constructive solid geometry and procedural texturing.
|
|
|
Graphics Intro 64kB Using OpenGL
Peňáz, Martin ; Tóth, Michal (referee) ; Milet, Tomáš (advisor)
This bachelor’s thesis deals with the solution of graphics intro with limited size of 64kB. The work describes methods used for creation of graphics intro. It deals with procedural generation, compiler settings and final compression by exe packer application.
|
guest ::
