|
|
Analysis of General Polygon Boolean Operation Algorithms
Daněk, Tomáš ; Zemčík, Pavel (referee) ; Beran, Vítězslav (advisor)
This thesis deals with general polygon boolean operation algorithms. Boolean operations are e.g. intersection, union or difference. A general polygon can be e.g. a selfinterecting polygon with inner hole. Clipping of polygons against a rectangular window is probably the most familiar boolean operation on polygons. At first, basic definitions are listed. Then the principles of a selected set of boolean operation algorithms are reviewed. Finally, a complex comparison of the algorithms is undertaken. Performance as well as the ability to handle degenerate cases are tested. The output of this thesis is an overall evaluation of algorithm properties and a dynamic library that contains the implementation of all of the tested algorithms.
|
|
|
Blender Tutorial
Tomšík, Filip ; Žák, Pavel (referee) ; Kubíček, Radek (advisor)
This thesis focuses on the increasingly popular shareware Blender which has growing application possibilities in various branches. The thesis aims at a general description of basic modelling techniques working with mesh objects as well as curves used for creating models and computer graphics. Part of the thesis is dedicated to a description of animation abilities of the programme, an outline of dierent methods and a more detailed description of correspondent modules. The central point of the thesis is to introduce the reader to the basic and advanced modelling techniques and their use in Blender, in the form of a tutorial.
|
|
|
Analysis of General Polygon Boolean Operation Algorithms
Daněk, Tomáš ; Zemčík, Pavel (referee) ; Beran, Vítězslav (advisor)
This thesis deals with general polygon boolean operation algorithms. Boolean operations are e.g. intersection, union or difference. A general polygon can be e.g. a selfinterecting polygon with inner hole. Clipping of polygons against a rectangular window is probably the most familiar boolean operation on polygons. At first, basic definitions are listed. Then the principles of a selected set of boolean operation algorithms are reviewed. Finally, a complex comparison of the algorithms is undertaken. Performance as well as the ability to handle degenerate cases are tested. The output of this thesis is an overall evaluation of algorithm properties and a dynamic library that contains the implementation of all of the tested algorithms.
|
guest ::
