|
|
Mesh mending
Masařík, Tomáš ; Pelikán, Josef (advisor) ; Krajíček, Václav (referee)
The bachelor work is focused on triangle meshes mending. It includes topological and also geometrical aspects. I continue working on Individual Software Project and Software Praxis. Before I have created program capable of detecting and repairing some of triangle mesh errors. Main goal of creation such a program was a research using scans of human faces at Faculty of Anthropology of Nature Science at Charles University in Prague. There are analyzed issues and there are evaluated existing solution in this paper. In second section I describe implemented algorithms, user's and programmer's documentation as well. The results are demonstrated At the end and there are proposed some future extensions.
|
|
|
Computational complexity of combinatorial problems in specific graph classes
Masařík, Tomáš ; Fiala, Jiří (advisor)
The topic of this diploma thesis is the edge distance labeling problem with specified parametres p, q and λ. We found a dychotomy for p = 2 and q = 1. So the problem is polynomial if λ ≤ 4 and it is NP-complete for λ > 4. The boundary is shifted by one prior to the vertex distance labeling problem, which has already been solved. Polynomial cases are characterized as some special paths and cycles with a few additional vertices. To show NP-completeness we use a well-known NP-complete problem of Monotone not all equal 3-SAT. That section has four parts: One for odd λ, one for even λ and two more reductions for λ = 5 and λ = 6. 1
|
|
|
Vliv zavedení sankcí na obchodní výměnu mezi Českou republikou a Ruskou federací
Masařík, Tomáš
Masařík T., The influence of sanctions on trade exchange between the Czech Republic and the Russian Federation. Bachelor's Thesis. Brno: Mendel University in Brno, Faculty of Business and Economics, 2009. The bachelor's thesis examines the influence of sanctions for the trade exchange between the Czech Republic and the Russian Federation. The data utilized for this thesis were adopted from the Czech Statistical Office, specifically for the 2008 to 2016 period. The data was a subject of a qualitative analysis, which examines the influence of sanctions as well as the ongoing Russian economic crisis. As a result, the Russian Federations suffers a heavy recession, which is the cause of the decrease in trade exchange between the discussed countries.
|
|
|
Faktory ovlivňující čistý export zemí V4
Masařík, Tomáš
Masařík T., Factors influencing the net export of the Visegrad group countries. Diploma thesis. Brno: Mendel University, Faculty of Business and Economics, 2019. The diploma thesis deals with chosen macroeconomic indicators influencing the net export of the Visegrad Group countries. The Visegrad Group contains the Czech Republic, Slovakia, Poland, and Hungary. The theoretical part studies foreign trade and its individual indicators influencing it. The practical part performs a multivariate regression analysis identifying 4 models that create the scope of my diploma thesis goals. The analysis results indicate that foreign trade of individual countries is affected by a different structure of static factors. The utilized data are from Eurostat and Organization for Economic Co-operation and Development website, spe-cifically data reaching from the years 2004-2017.
|
|
|
Variants of graph labeling problems
Masařík, Tomáš ; Fiala, Jiří (advisor) ; Fellows, Michael R. (referee) ; Hell, Pavol (referee)
This thesis consists of three parts devoted to graph labeling, hereditary graph classes, and parameterized complexity. Packing coloring, originally Broadcasting Chromatic number, assigns natural numbers to vertices such that vertices with the same label are in distance at least the value of the label. This problem is motivated by the assignment of frequencies to the transmitters. We improve hardness on chordal graphs. We proof that packing coloring on chordal graphs with diameter 3 is very hard to approximate. Moreover, we discuss several positive results on interval graphs and on related structural graph parameters. Hereditary graph classes are preserved under vertex deletion. We study graphs that do not contain an induced subgraph H. We prove that 3-coloring is polynomial-time solvable for (P3 + P4)-free and (P2 + P5)-free graphs and thus we have solved the last open cases for the problem on H-free graphs where H has up to 7 vertices. Fair problems are a modification of graph deletion problems, where, instead of minimizing the size of the solution, the aim is to minimize the maximum number of neighbors in the deleted set. We show that those problems can be solved in FPT time for an MSO1 formula parameterized by the size of the formula and the twin cover of the graph. Moreover, we define a basic...
|
|
|
Computational complexity of combinatorial problems in specific graph classes
Masařík, Tomáš ; Fiala, Jiří (advisor)
The topic of this diploma thesis is the edge distance labeling problem with specified parametres p, q and λ. We found a dychotomy for p = 2 and q = 1. So the problem is polynomial if λ ≤ 4 and it is NP-complete for λ > 4. The boundary is shifted by one prior to the vertex distance labeling problem, which has already been solved. Polynomial cases are characterized as some special paths and cycles with a few additional vertices. To show NP-completeness we use a well-known NP-complete problem of Monotone not all equal 3-SAT. That section has four parts: One for odd λ, one for even λ and two more reductions for λ = 5 and λ = 6. 1
|
|
|
Computational complexity of combinatorial problems in specific graph classes
Masařík, Tomáš ; Fiala, Jiří (advisor) ; Dvořák, Zdeněk (referee)
The topic of this diploma thesis is the edge distance labeling problem with specified parametres p, q and λ. We found a dychotomy for p = 2 and q = 1. So the problem is polynomial if λ ≤ 4 and it is NP-complete for λ > 4. The boundary is shifted by one prior to the vertex distance labeling problem, which has already been solved. Polynomial cases are characterized as some special paths and cycles with a few additional vertices. To show NP-completeness we use a well-known NP-complete problem of Monotone not all equal 3-SAT. That section has four parts: One for odd λ, one for even λ and two more reductions for λ = 5 and λ = 6. 1
|
|
|
Mesh mending
Masařík, Tomáš ; Pelikán, Josef (advisor) ; Krajíček, Václav (referee)
The bachelor work is focused on triangle meshes mending. It includes topological and also geometrical aspects. I continue working on Individual Software Project and Software Praxis. Before I have created program capable of detecting and repairing some of triangle mesh errors. Main goal of creation such a program was a research using scans of human faces at Faculty of Anthropology of Nature Science at Charles University in Prague. There are analyzed issues and there are evaluated existing solution in this paper. In second section I describe implemented algorithms, user's and programmer's documentation as well. The results are demonstrated At the end and there are proposed some future extensions.
|
guest ::
