|
|
Data structures for rendering non-polygonal geometry
Kuckir, Ivan ; Křivánek, Jaroslav (advisor) ; Vorba, Jiří (referee)
In modern 3D graphics, scenes made of triangles are usually used, combined with methods based on ray tracing. Hierarchical data structures, called accelerating trees, are often used to speed up the search for intersection between ray and the scene. When testing the best current methods with non-polygonal geometry (line segments), we have found out that those structures cannot build an effective tree in many cases. The aim of this work is to formulate the problem mathematically. Thanks to this, the whole subject becomes more transparent and we can see the shortcomings of current methods, which have not yet been pointed out. At the result, we develop an algorithm which generalizes all current methods, which is not dependent on geometry and directly shows the space for improvement.
|
|
|
Exploiting Structures in Automated Planning
Kuckir, Ivan ; Barták, Roman (advisor) ; Chrpa, Lukáš (referee)
This thesis focuses on improving the process of automated planing through symmetry breaking. The aim is to describe symmetries, which are often observed by human programmers, but haven't been properly theoretically formalized. After an analysis of available research, there are new definitions of symmetries proposed in context of classical planning, such as state equivalence, T1 automorphisms and more general automorphisms of constants. Several theorems are proved about new symmetries. As a result, an algorithm for detecting a special symmetry class is proposed, together with a method of exploiting such class during planning. Experimens are made to show the effect of symmetry breaking on the performance of the planner. Powered by TCPDF (www.tcpdf.org)
|
|
|
Data structures for rendering non-polygonal geometry
Kuckir, Ivan ; Křivánek, Jaroslav (advisor) ; Vorba, Jiří (referee)
In modern 3D graphics, scenes made of triangles are usually used, combined with methods based on ray tracing. Hierarchical data structures, called accelerating trees, are often used to speed up the search for intersection between ray and the scene. When testing the best current methods with non-polygonal geometry (line segments), we have found out that those structures cannot build an effective tree in many cases. The aim of this work is to formulate the problem mathematically. Thanks to this, the whole subject becomes more transparent and we can see the shortcomings of current methods, which have not yet been pointed out. At the result, we develop an algorithm which generalizes all current methods, which is not dependent on geometry and directly shows the space for improvement.
|
guest ::
