Following thesis regards itself with Voronoi diagram creation in 3D using a graphics card. It focuses on and compares certain algorithms that construct the diagram when given set of points in space. For this purpose there have been two algorithms implemented.  First one creates Delaunay tetrahedralization using parallel splitting and flipping of present tetrahedra. Then it transforms it into a Voronoi diagram. The second algorithms utilizes planes to cut a mesh until required shapes are created.  Testing shows the advantages and disadvantages of these algorithms and their relative performance. Main takeaway from this work for these algorithms is the relative sensitivity of the second method to the use of inappropriate shape in relation to given set of points. For the other algorithm its slower start and relative unsuitability for use with smaller sets of points is apparent, but it is greatly optimized for big sets.

This work deals with the description and analysis of image data, which related to the initial stages of the thin film growth. The introductory retrieval section includes a description of thin films and methods of their deposition. The following part is an overview of the growth models of thin layers. The heart of my thesis is the analysis and modification of morphological methods and interpretation of their results. The emphasis is placed on the statistical aspect of methods and their optimal implementation due to the accuracy of the results. The work shows how to modify the radial distribution function and methods based on so-called Voronoi and Delaunay triangulation tessellation so that they can better affect the character of test data. New methods are tested both on the experimental and model data. Then we examine their robustness, sensitivity and their mutual independence. At the conclusion it is introduced and analyzed a new model of thin film growth.

This diploma thesis is focused on research of localization algorithms. Each developed localization algorithms are generally application specific. Because of application requirements diversity, many variants of localization algorithms exist. In case of finding appropriate localization algorithm for concrete application usability, existence of real condition simulation environment is useful. Development of this simulation environment was made simultaneously with both localization algorithms. At first, survey of available localization technic was performed and their summary was listed. Further work was aimed on research of two localization algorithms. Both of them use triangulation mechanism to determine unknown node position. This mechanism is based on measurement of distance to three reference points with known position. It would seem that both algorithms are similar, but simulation shows their difference and presents their suitability for diverse conditions.

The diploma thesis is focused on two localization algorithms, iterative algorithm, and a linked algorithm simulated in MATLAB. Further, the investigation of the influence of input errors on the errors in localization of sensor nodes examined algorithms and explore possible relationships between the input errors and localization errors. Subsequently are submitted possible ways to optimize and their results.

This document focuses on stereoscopic vision, machine vision and 3D scene reconstruction. First we create mathematic framework which is later used to determine solution for problems appearing during creation of scene reconstruction application.

The core of the present master's thesis is a sociolinguistic analysis of the conversational marker 'che' in Rioplatense Spanish. Initially, the history and concept of conversation analysis are presented. The process of grammaticalization and the classification of pragmatic markers are also described. Secondly, the author defines sociolinguistics and, on the basis of William Labov's work, explains methodological problems related to collecting real language data. The terms Rioplatense Spanish and 'porte?o' are widely described as well. Further, 'che' is investigated theoretically as a case of interjection that resulted in a conversational particle. The proper sociolinguistic investigation is based on three methods: introspection, qualitative and quantitative analysis. Functions of 'che', as well as its occurence according to different social factores are studied in this work.

This thesis deals with the issue of wireless sensor networks and communication protocols. Is explained of what the network is composed, what standards are used and in what sectors are most often used. The main scope of work is to introduce with the localization algorithms using in WSN. Algorithms are clearly divided into groups according to the methods used. In work is describes the structure used simulation tools J-Sim, for creating a wireless sensor network. To create network will be then applied different localization algorithms, which must first be implemented in a simulator using Java code. All generated classes and the algorithms are detailed described in the work. Results from simulations are detailed and graphically displays for individual localization algorithms.

The general aim of my master´s thesis is to study the actual principles of 3D scanning, the anatomy of human teeth, use of 3D scanning in dentistry and other medical fields. Another part of this thesis is about software and hardware design of 3D scanning system, which enable us to scan dental casts. This design is using webcam, projector and turntable. The principle of scanning is based on the activ triangulation. The output of 3D scanner is a horde of spots, which are used for reconstruction of a surface. The reconstructed surface is finally saved as .stl format.

Many architecure, medical and engineering applications need a spacial support for various numerical computations (i.e. FEM simulations). Tetrahedral meshes are one of perspective spatial representations for them. In this thesis, several possibilities of effective tetrahedral mesh representation for its generating and processing are described. A computer library for the mesh processing is proposed which can be characterized by memory  efficient imposition of the mesh while preserving the ability to apply topological and geometric algorithms effectively. The library is implemented in C++ language using templates. Time and space complexity of typical mesh operations is compared with CGAL library and according to measurements the proposed library has lower memory requirements than CGAL.

This master thesis is focused on parametrization of image point neighborhood. Some methods for point localization and point descriptors are described and summarized. Gabor filter is described in detail. The practical part of thesis is chiefly concerned with particle filter tracking system. The weight of each particle is determined by the Gabor filter.