|
|
3D Triangles Polygonal Mesh Conversion on 3D Spline Surfaces
Jahn, Zdeněk ; Šiler, Ondřej (referee) ; Kršek, Přemysl (advisor)
In computer graphics we can handle unstructured triangular 3D meshes which are not too usable for processing through their irregularity. In these situations it occurs need of conversion that 3D mesh to more suitable representation. Some kind of 3D spline surface can be proper alternative because it institutes regularity in the form of control points grid and that's why it is more suitable for next processing. During conversion, which is described in this thesis, quadrilateral 3D mesh is constructed at first. This mesh has regular structure but mainly the structure corresponds to structure of control points grid of resulting 3D spline surface. Created quadrilateral 3D mesh can be saved and consequently used in specific modeling applications for T-spline surface creation.
|
|
|
The Walkthrough Aplication in Large 3D Terrain
Panáček, Petr ; Mikolov, Tomáš (referee) ; Bartoň, Radek (advisor)
Rendering of large terrain is common problem in 3D computer graphics. Even if we have high-tech hardware equipment today, there is still a lot of high computational demand. Therefore new algorithms are developed. These algorithms include level of detail rendering and culling objects in dependence on view of camera. This bachelor thesis describes one of these algorithms and its modifications. Part of the problem is also creation of tiles hierarchy for these algorithms. Result of the thesis is application implemented in OpenSceneGraph.
|
|
|
Implementation of Ford-Fulkerson Algorithm
Makovský, Benjamin ; Rychnovský, Lukáš (referee) ; Masopust, Tomáš (advisor)
This work describes the design of the graphic implementation of the Ford-Fulkerson Algorithm for searching the maximum flow and the minimal cut in the network. It contains a brief introduction with the theory of the graphs and the flows in the networks, it describes the principle of the Ford-Fulkerson Algorithm. The object design representing the graph in the program is cited, the drawing of the graph by the program and the creation of the graphic user interface of the application is described. The final program is worked up as a Java applet which is placed at the public internet pages www.ffaplikace.php5.cz.
|
|
|
Graphics Graph Representation
Matula, Radek ; Goldefus, Filip (referee) ; Masopust, Tomáš (advisor)
This Master Thesis deals with the drawing algorithms of graphs known from the mathematical theory. These algorithms deals with an appropriate distribution of the graph vertices in order to obtain the most clear and readable graphs for human readers. The main objective of this work was also to implement the drawing algorithm in the application that would allow to edit the graph. This work deals also with graphs representation in computers.
|
|
|
The Peak and the Territory
Mlynarčík, Štefan ; Smetana, Matěj (referee) ; Rathouský, Luděk (advisor)
The thesis is focused on symbolic revision of altitudes and border points of Tatra peaks. The subtle gesture disturbs exact and unambiguous textbook perception of a peak´s height. The thesis is happening on the given summits, the material used on their „growth“ and „transfer“ originates exclusively from immediate surroundings. The period of new summit´s existence is exposed to various weather conditions, eventualy to human factor, thus we can consider it as undetermined in terms of time. The issue consists of 5 video documentations of actions on the given Tatra peaks. The thesis is not exhausted by this. On the contrary, it promises spontaneous long-termed continuation.
|
|
|
The Peak and the Territory
Mlynarčík, Štefan ; Smetana, Matěj (referee) ; Rathouský, Luděk (advisor)
The thesis is focused on symbolic revision of altitudes and border points of Tatra peaks. The subtle gesture disturbs exact and unambiguous textbook perception of a peak´s height. The thesis is happening on the given summits, the material used on their „growth“ and „transfer“ originates exclusively from immediate surroundings. The period of new summit´s existence is exposed to various weather conditions, eventualy to human factor, thus we can consider it as undetermined in terms of time. The issue consists of 5 video documentations of actions on the given Tatra peaks. The thesis is not exhausted by this. On the contrary, it promises spontaneous long-termed continuation.
|
|
|
Implementation of Ford-Fulkerson Algorithm
Makovský, Benjamin ; Rychnovský, Lukáš (referee) ; Masopust, Tomáš (advisor)
This work describes the design of the graphic implementation of the Ford-Fulkerson Algorithm for searching the maximum flow and the minimal cut in the network. It contains a brief introduction with the theory of the graphs and the flows in the networks, it describes the principle of the Ford-Fulkerson Algorithm. The object design representing the graph in the program is cited, the drawing of the graph by the program and the creation of the graphic user interface of the application is described. The final program is worked up as a Java applet which is placed at the public internet pages www.ffaplikace.php5.cz.
|
|
|
The Walkthrough Aplication in Large 3D Terrain
Panáček, Petr ; Mikolov, Tomáš (referee) ; Bartoň, Radek (advisor)
Rendering of large terrain is common problem in 3D computer graphics. Even if we have high-tech hardware equipment today, there is still a lot of high computational demand. Therefore new algorithms are developed. These algorithms include level of detail rendering and culling objects in dependence on view of camera. This bachelor thesis describes one of these algorithms and its modifications. Part of the problem is also creation of tiles hierarchy for these algorithms. Result of the thesis is application implemented in OpenSceneGraph.
|
|
|
Graphics Graph Representation
Matula, Radek ; Goldefus, Filip (referee) ; Masopust, Tomáš (advisor)
This Master Thesis deals with the drawing algorithms of graphs known from the mathematical theory. These algorithms deals with an appropriate distribution of the graph vertices in order to obtain the most clear and readable graphs for human readers. The main objective of this work was also to implement the drawing algorithm in the application that would allow to edit the graph. This work deals also with graphs representation in computers.
|
|
|
3D Triangles Polygonal Mesh Conversion on 3D Spline Surfaces
Jahn, Zdeněk ; Šiler, Ondřej (referee) ; Kršek, Přemysl (advisor)
In computer graphics we can handle unstructured triangular 3D meshes which are not too usable for processing through their irregularity. In these situations it occurs need of conversion that 3D mesh to more suitable representation. Some kind of 3D spline surface can be proper alternative because it institutes regularity in the form of control points grid and that's why it is more suitable for next processing. During conversion, which is described in this thesis, quadrilateral 3D mesh is constructed at first. This mesh has regular structure but mainly the structure corresponds to structure of control points grid of resulting 3D spline surface. Created quadrilateral 3D mesh can be saved and consequently used in specific modeling applications for T-spline surface creation.
|
guest ::
