This thesis deals with geometric constructions in Secondary School Mathematics. The first chapter is dedicated to its historical development followed by the theoretical explanation and description of it. The next chapter discusses solubility of construction problems by means of a ruler and&#...

The thesis deals with the theory needed for studying generalized Voronoi diagrams. At the beginning it focuses on the Ordinary Voronoi diagram and briefly introduces its definition and characteristics. After that three different algorithms for this diagram are described, specifically Incremental&...

This diploma thesis deals with connections between subdivision algorithms of geometric modeling and iterated function systems (IFS) of fractal theory. These connections have recently appeared in the literature. We introduce IFS for subdivision curves, providing rigorous justification of the main ...

This thesis shows the relations among the hamiltonian cycle, the r-trestle and the toughness of a graph and how the relations change considering general graphs, chordal graphs and planar graphs. Some other relations dealing with generalizing hamiltonicity, the toughness of a graph and&#...

This diploma thesis deals with a modelling of hierarchy in topologically structured data. The input data is the data in the SHP format ? layers of districts, counties and the Czech Republic. This data is transformed into the object-relational storage SDO_GEOMETRY using the Bentley&...

The thesis is focused on map simplification in real time. It solves vario-scale, data redundancy and a structure for generalization data. The first, the thesis outlines the problem of on-line map simplification. The secondly, it is searching data structure for generalization in real...

Thesis is concerned with a development of maintenance of large-scale maps and describes procedures of large-scale maps maintenance in the past and in the present. The description of the maintenance of cadastral maps is focused on updating of detailed planimetric points, especially on&#x...

The objective of this diploma thesis is reconnaissance of possibilities of 3D geographical information systems and their applicability of Understanding Historic Buildings process data. Is designed conceptual data model. This model is used as a basis for physical database model. Physical data...

The aim of this work is to describe and explain the relationships between Conjugate gradient, Lanczos algorithm, orthogonal polynomials, quadrature rules and Jacobi matrix. We show how can to obtain Gauss quadrature rules by approximation of Riemann?Stieltjes integral and the nodes and ...

The goal is to summarize knowledge about the behavior of the conjugate gradient method in finite precision arithmetic, performing numerical experiments, and investigation of some problems connected with the mathematical model of finite precision CG computations.

This thesis investigates the influence of vegetation and terrain slope on the precision of airborne laser scanning. On nineteen specific locations with terrain slope varying between 0 and 15 degrees and surfaces such as solid suface, grassland, field and forest a geodetic land surv...

Our diploma thesis deals with questions of solvability or multipoint or nonlocal boundary value problems. Specifically, in this work are investigated the following boundary value problems: three-point problem, three-point problem with damping and four-point problem. We are looking for systems of&...

This work deals with practical realization of localization method of Special Maps from III. military mapping, which was suggested in previous bachelor thesis. The basic unit of localization is not the entire map sheet but its 1/16 part, which is called a meting sheet. The...

The diploma thesis examines the cartographic methods by which it is possible to express the temporal changes of spatial data. It focuses both on the methods historically older, the newer methods. The work follows on my bachelor thesis deals with the development toponyms on old...

Diploma thesis is divided into three parts. In the first part we review some basic facts of the computational complexity theory, present a standard model of computation called Turing machine and use it to define some complexity classes. In the next part we take a closer&#...