|
|
Minimal Representation of the Božetěchova Complex
Král, Tomáš ; Beran, Vítězslav (referee) ; Herout, Adam (advisor)
The document describes developing graphical application with limited size. It describes suitable techniques for a polygonal mesh's compression. The second part is focused on practical usage of this techniques for developing scene in 3D modeling environment and also describes how to transfer this model to the executable file. The work attends to optimalizations of source code compilation and executables compression at the final chapters.
|
|
|
Minimal Representation of the Božetěchova Complex
Piovarči, Rastislav ; Kajan, Rudolf (referee) ; Vlček, Adam (advisor)
The goal of this thesis is to briefly familiarize the reader with damoscene phenomena as a foundation for creation of minimalistic application, which it implements. Then it explains the process of designing and implementation of minimalistic application which displays the Božetechova complex. The aim of this interactive application is to reproduce the Božetěchova complex in the best possible quality using a restricted size binary file. It uses means like procedural textures on the bases of Perlin noise, or multilevel comprimation and instantiating of model geometry to achieve this goal.
|
|
|
Combinatorial problems with coins
Hamáček, Jan ; Slavík, Antonín (advisor) ; Fiala, Jiří (referee)
Práce se zabývá otázkami reprezentace zvolené částky pomocí libovolného množství mincí předep- saného typu. V první kapitole odvozujeme vzorce pro počet nereprezentovatelných částek a hodnotu největší nereprezentovatelné částky pro dvoumincové systémy. Dále ukazujeme grafový algoritmus pro výpočet Frobeniova čísla a d·kaz NP-úplnosti rozhodovacího problému reprezentovatelnosti zvolené částky v systému s více mincemi. V druhé kapitole se zabýváme výpočtem počtu reprezentací částky zvláš' v systémech o dvou nebo více mincích. Ve třetí kapitole se věnujeme otázce, zda lze ve zvoleném systému mincí použít hladový algoritmus pro nalezení reprezentace částky pomocí nejmenšího možného množství mincí. Poslední kapitola obsahuje sbírku řešených logických úloh o mincích. 1
|
|
|
Minimal Representation of the Božetěchova Complex
Piovarči, Rastislav ; Kajan, Rudolf (referee) ; Vlček, Adam (advisor)
The goal of this thesis is to briefly familiarize the reader with damoscene phenomena as a foundation for creation of minimalistic application, which it implements. Then it explains the process of designing and implementation of minimalistic application which displays the Božetechova complex. The aim of this interactive application is to reproduce the Božetěchova complex in the best possible quality using a restricted size binary file. It uses means like procedural textures on the bases of Perlin noise, or multilevel comprimation and instantiating of model geometry to achieve this goal.
|
|
|
Minimal Representation of the Božetěchova Complex
Král, Tomáš ; Beran, Vítězslav (referee) ; Herout, Adam (advisor)
The document describes developing graphical application with limited size. It describes suitable techniques for a polygonal mesh's compression. The second part is focused on practical usage of this techniques for developing scene in 3D modeling environment and also describes how to transfer this model to the executable file. The work attends to optimalizations of source code compilation and executables compression at the final chapters.
|
guest ::
