|
|
Applications Source Code Improvement
Obluková, Alena ; Bartík, Vladimír (referee) ; Kreslíková, Jitka (advisor)
The problem discussed in this master's thesis is to increase the usability of aplication Classycle, especially to increase the comprehensibility of its outputs. Having studied theories of refactoring, testing, graphs and after thorough analysis of Classycle, it has been created new outputs of the application, displaying the output data in graphics form. The application has been tested with real-life data and it is ready to be deploy in company. Thanks to creation of new forms of outputs, which are discribed in practical part of master's thesis, programmer obtains a powerful tool for detection dependences between classes and packages in code.
|
|
|
Registration of Photos to 3D Model
Deák, Jaromír ; Brejcha, Jan (referee) ; Čadík, Martin (advisor)
This work refers existing solutions and options for the task registration of photos to 3D model based on the previous knowledge of the geographic position of the camera. The contribution of the work are new ways and possibilities of the solution with the usage of graph algorithms. In this area, the work interests are useful points of interest detection in input data, a construction of graphs and graph matching possibilities.
|
|
|
Searching trails in maps
Drahovský, Robin ; Pangrác, Ondřej (advisor) ; Veselý, Pavel (referee)
This thesis describes design and implementation of an application capable of finding the shortest paths in real world map data, while taking elevation data into account. Path finding is fast and can be adjusted to user's needs without the need for graph rebuilding, what differentiates this application from others, that only allow user to work with predefined search profiles. In addition to path finding, the application can generate highly compact graph from map data in OSM format. This allows fast access to information necessary for finding the shortest path. The application can render map data with custom rendering style and contour lines, but also can display map from OpenStreetMaps project servers.
|
|
| |
|
|
Graph Clustering by Means of Evolutionary Algorithms
Kohout, Jan ; Neruda, Roman (advisor) ; Mrázová, Iveta (referee)
Partitioning nodes of a graph into clusters according to their simi- larities can be a very useful but complex task of data analysis. Many dierent approaches and algorithms for this problem exist, one of the possibilities is to utilize genetic algorithms for solving this type of task. In this work, we analyze dierent approaches to clustering in general and in the domain of graphs. Several clustering algorithms based on the concept of genetic algorithm are proposed and experimentally evaluated. A server application that contains implementations of the these algorithms was developed and is attached to this thesis.
|
|
|
Risk modelling in transportation
Lipovský, Tomáš ; Pavlas, Martin (referee) ; Popela, Pavel (advisor)
This thesis deals with theoretical basics of risk modelling in transportation and optimization using aggregated traffic data. In this thesis is suggested the procedure and implemented the application solving network problem of shortest path between geographical points. The thesis includes method for special paths evaluation depending on the frequency of traffic incidents based on real historical data. The thesis also includes a~graphical interface for presentation of the achieved results.
|
|
|
Voice Controled Map of FIT
Huták, Petr ; Grézl, František (referee) ; Szőke, Igor (advisor)
This bachelor's thesis describes the design and developement of navigation system for the Faculty of information technology, Brno university of technology with voice control. It explains the methods used for finding the shortest path on the map, speech recognition and describes existing navigation systems with voice control. The thesis is focused on creating a user interface with voice control. The purpose of voice control is to make usage of this navigation system more accesible and effective in a public place. Speech recognizing is realized with BSAPI library.
|
|
|
Demonstration of Graph Algorithms
Varadinek, Jakub ; Zámečníková, Eva (referee) ; Křivka, Zbyněk (advisor)
This bachelor thesis deals with the development of the application for demonstration and visualization of several graph algorithms. The application allows the user to create a graph, rate edges or name and layout vertices. The individual algorithms can be performed in created graph for visual observation how the algorithm works. There is also the possibility of stepping through the chosen algorithm and an interactive mode where next steps are selected by the user and the application checks the correctness of these steps.
|
|
|
Preparation of Homeworks in the Course Algorithms
Miloš, Roman ; Masopust, Tomáš (referee) ; Lukáš, Roman (advisor)
This Bachelor's thesis is about preparing of homeworks for the course Algorithms on graphs. Thesis contains five parts. The first task is to create graphs using adjacency matrix, next is to create a graph using the adjacency lists. The third task is to implement Prim algorithm for finding the minimum skeleton. The fourth is the implementation of Floyd-Warshall algorithm for finding minimum paths in the graph, finding the connection and completeness of the graph. The fifth task is to identify and implement discretion chart NP-complete problem of finding a maximum clique of graph.
|
|
|
Shortest Paths in a Graph
Krauter, Michal ; Křivka, Zbyněk (referee) ; Masopust, Tomáš (advisor)
This thesis deals with shortest paths problem in graphs. Shortest paths problem is the basic issue of graph theory with many pracitcal applications. We can divide this problem into two following generalizations: single-source shortest path problem and all-pairs shortest paths problem. This text introduces principles and algorithms for generalizations. We describe both classical and new more efficient methods. It contains information about how some of these algorithms were implemented and offers an experimental comparison of these algorithms.
|
guest ::
