|
|
Hamiltonian cycles in cubic graphs
Melka, Jakub ; Kratochvíl, Jan (advisor) ; Pergel, Martin (referee)
In this work we study the complextity of Thomasson's algorithm over a special class of cubic graphs. This algorithm nds another hamiltonian circuit, if it starts with a rst one. An open problem is the complexity of this algorithm, but a class of cubic graphs has been found, where for each graph in this class, there exists a hamiltonian circuit and an edge on it, for which Thomasson's algorithm needs exponential number of steps. The goal of this work was to gure out, if Thomasson's algorithm needs exponential number of steps for any hamiltonian circuit and any edge on graphs from this class. We succeeded in proving, that indeed is so.
|
|
|
Integer programming and its applications
Eliáš, Marek ; Pergel, Martin (advisor) ; Hladík, Milan (referee)
In this thesis we present and implement several graph algorithms. In the rst part, we discus algorithm for the minimum weighted perfect matching in bipartite and general graphs based on the primal-dual method and their modi cations. In the second part, there are algorithms for the max-cut in planar graphs and Christo des' heuristic for TSP. We present full descriptions of these algorithms providing either proof of correctness or reference to the literature. The last part deals with two approaches which we use to visualise these algorithms with di erent degree of interactivity both allowing custom graph on input.
|
|
|
Universal discrete simulator
Vytasil, Jiří ; Pergel, Martin (advisor) ; Jančík, Pavel (referee)
In this thesis we analyzed the design and implementation of the program allows you to perform discrete-event simulation. Further in the program we implemented visualization of discrete-event simulation. Emphasis is placed mainly on universality. In addition to the program and its description includes information of discrete-event simulation, which allows easier understanding of program operation. For a description of discrete-event simulation using finite-state automata and regular grammars. These parts are described more in order to more easily understand the description of the discrete-event simulation. The system also allows adjustment of input files for easier operation of the program.
|
|
|
Universal discrete simulator
Vytasil, Jiří ; Pergel, Martin (advisor) ; Holan, Tomáš (referee)
In this thesis we analyzed the design and implementation of the program allowing you to perform discrete-event simulation. Further in the program we implemented visualization of discrete-event simulation. Emphasis is placed mainly on~universality. In addition to the program and its description includes information of discrete-event simulation, which allows easier understanding of~program operation. For a description of discrete-event simulation using finite-state automata and regular grammars. These parts are described more in order to more easily understand the description of the discrete-event simulation. The~system also allows adjustment of input files for easier operation of the program. Powered by TCPDF (www.tcpdf.org)
|
|
|
Visualisation of phenomena related to linear programming
Gregor, Jan ; Pergel, Martin (advisor) ; Hladík, Milan (referee)
This thesis introduces design and implementation of scripting language especially focused on visualization of phenomena related to linear programming. We describe a construction of an interpreter and a theory around it. Further we specify what the linear programming is and we show the simplex method. Regarding requierements of manipulation and visualization in vector space of dimension greater than three, there could not be used standard methods, e.g., from computer graphic. That is why there is also a description of modified algorithms used in this cases. Namely projection, transformation and drawing of n-dimensional polyhedron. This thesis also contains examples of scripts showing possibilities of the language and its interpreter.
|
|
|
Informational system for cooperation of small groups
Svoboda, Martin ; Bílý, Tomáš (advisor) ; Pergel, Martin (referee)
The main aim of this work is to implement concrete informational system for cooperation and information interchange within small working groups of users and to analyze all aspects which have exposed to be important during the development of this informational system. That means not only to design the structure of relatively complex program, but also to design main concepts of its behaviour and other features, which significantly affect functionality, which is then provided by the system to its users. For example it comprises the draft of user registration model, membership of those users in groups, multilevel hierarchy of user powers or managing user sessions. All those important models are discussed in this work and there are also analyzed their advantages and potential difficulties. The second part of this work contains the description of implementation of all interesting or important parts of the system. It means for example the mechanisms of database queries execution, generating universal paged listings, editing processes and inputs from users, working desktop layout or other functionality provided by the kernel, as well as the description of system sections such as Actions planning, Discussions, Inquiries etc.
|
|
|
Farming robot R4Farmer
Hurt, Tomáš ; Pergel, Martin (advisor) ; Holan, Tomáš (referee)
The aim of the thesis is to propose a robotic farmer emulator. After designing this toolkit, we focus on algorithms solving particular problems related to the use of such a robot. Mainly we attach the question of a route planning during the field processing (while ploughing, seeding and irrigating). The project should help with a design of a real robot which is being designed separately by other colleagues. It should help with the study of feasibility and eliminate particular risks of economic loss (caused by move of a real robot on a field - or outside of it).
|
|
|
Program supporting measuring of buildings
Lyčka, Marek ; Holan, Tomáš (advisor) ; Pergel, Martin (referee)
V práci je navržený systém měření a záznamu rozměrů interiérů budov s pomocí přiložených podpůrných programů. Součástí řešení je také aplikace, která naměřená data umí převést na virtuální 3D model. Veškeré nástroje jsou vysvětleny z uživatelské a programátorské stránky a na testovacích datech je demonstrována užitelnost celého řešení. Powered by TCPDF (www.tcpdf.org)
|
|
|
3D-surface smoothing
Mácha, Radek ; Pergel, Martin (advisor) ; Sterzik, Marek (referee)
The present work deals with 3D surface subdivision methods. The key areas are the quality of subdivision sequence outputs and the development of methods that measure it. The Catmull-Clark and Butterfly (8-point stencil) outputs are being measured for edge length, face surface and angles between adjacent faces. Furthermore, combined sequences of subdivision algorithms are being discussed, as well as the selection of one that meets custom criteria.
|
|
| |
guest ::
