|
|
Graphical Visualization of PE EXE Statistical Analysis Results
Rusnák, Jakub ; Jirák, Ota (referee) ; Peringer, Petr (advisor)
This bachelor's thesis describes statistical analysis of executable files in Portable Executable file format (PE EXE) with the entropy map, which is used to detect computer viruses which attack those files. It describes the PE EXE file format and methods of computer virus infection. The main objective is design and implementation of computer program for visualization of results of this statistical analysis. The application is implemented in c++ programming language with object oriented design on Microsoft Windows platform. It uses the 2D graphic library Cairo.
|
|
|
Web applications supporting education of 2D computer graphics
Drápela, Zbyněk ; Sysel, Petr (referee) ; Rajmic, Pavel (advisor)
The bachelor thesis deals with two-dimensional computer graphics. Specifically, Bézier curves, increasing their degree without changing their shape and performing subdivision. Furthermore, the Catmull--Clark subdivision algorithm and synthesis of procedural textures. The work aimed to describe the theoretical basis of these areas and to create four web applets using JavaScript and HTML, which will be used as an aid in teaching computer graphics.
|
|
|
Analysis of General Polygon Boolean Operation Algorithms
Daněk, Tomáš ; Zemčík, Pavel (referee) ; Beran, Vítězslav (advisor)
This thesis deals with general polygon boolean operation algorithms. Boolean operations are e.g. intersection, union or difference. A general polygon can be e.g. a selfinterecting polygon with inner hole. Clipping of polygons against a rectangular window is probably the most familiar boolean operation on polygons. At first, basic definitions are listed. Then the principles of a selected set of boolean operation algorithms are reviewed. Finally, a complex comparison of the algorithms is undertaken. Performance as well as the ability to handle degenerate cases are tested. The output of this thesis is an overall evaluation of algorithm properties and a dynamic library that contains the implementation of all of the tested algorithms.
|
|
|
Web applications supporting education of 2D computer graphics
Drápela, Zbyněk ; Sysel, Petr (referee) ; Rajmic, Pavel (advisor)
The bachelor thesis deals with two-dimensional computer graphics. Specifically, Bézier curves, increasing their degree without changing their shape and performing subdivision. Furthermore, the Catmull--Clark subdivision algorithm and synthesis of procedural textures. The work aimed to describe the theoretical basis of these areas and to create four web applets using JavaScript and HTML, which will be used as an aid in teaching computer graphics.
|
|
|
Graphical Visualization of PE EXE Statistical Analysis Results
Rusnák, Jakub ; Jirák, Ota (referee) ; Peringer, Petr (advisor)
This bachelor's thesis describes statistical analysis of executable files in Portable Executable file format (PE EXE) with the entropy map, which is used to detect computer viruses which attack those files. It describes the PE EXE file format and methods of computer virus infection. The main objective is design and implementation of computer program for visualization of results of this statistical analysis. The application is implemented in c++ programming language with object oriented design on Microsoft Windows platform. It uses the 2D graphic library Cairo.
|
|
|
Analysis of General Polygon Boolean Operation Algorithms
Daněk, Tomáš ; Zemčík, Pavel (referee) ; Beran, Vítězslav (advisor)
This thesis deals with general polygon boolean operation algorithms. Boolean operations are e.g. intersection, union or difference. A general polygon can be e.g. a selfinterecting polygon with inner hole. Clipping of polygons against a rectangular window is probably the most familiar boolean operation on polygons. At first, basic definitions are listed. Then the principles of a selected set of boolean operation algorithms are reviewed. Finally, a complex comparison of the algorithms is undertaken. Performance as well as the ability to handle degenerate cases are tested. The output of this thesis is an overall evaluation of algorithm properties and a dynamic library that contains the implementation of all of the tested algorithms.
|
guest ::
