Browsing by Subject "generacja siatek"
Now showing 1 - 2 of 2
- Results Per Page
- Sort Options
Item type:Article, Access status: Open Access , Definition and interpolation of discrete metric for mesh generation on 3D surfaces(2005) Głut, Barbara; Jurczyk, TomaszThe article concerns the problem of a definition of the control space from a set of discrete data (metric description gathered from different sources) and its influence on the efficiency of the generation process with respect to 2D and 3D surface meshes. Several methods of metric interpolation between these discrete points are inspected, including an automated selection of proper method. Some aspects of the procedures of creation and employment of the mesh control space based on the discrete set of points are presented. The results of using different variations of these methods are also included.Item type:Doctoral Dissertation, Access status: Open Access , Efektywne algorytmy automatycznej dyskretyzacji nietrywialnych trójwymiarowych form geometrycznych oraz ich obiektowa implementacja(2004-06-24) (Data obrony: 2007) Jurczyk, Tomasz
Wydział Elektrotechniki, Automatyki, Informatyki i ElektronikiThe task of the mesh generator is partitioning of the given geometric domain into a finite number of simple elements, conforming to requirements specified by user (e.g. type of elements, size, stretching or quality). The main contribution of this thesis is the development and optimization of an automated generator of unstructured anisotropic surface and volume meshes. The triangular meshes are created on parametric surfaces using a modified technique of incremental Delaunay triangulation. The anisotropic characteristic of mesh elements was obtained using non-Euclidean metric via the developed system of coordinate transformation. For three-dimensional problems, tetrahedral meshes can be generated using similar technique. The proposed improvements allow increasing the efficiency of discretization and enhancing the procedure of boundary constraining, which is one of the main problem of 3D Delaunay triangulation. Generation of meshes (both two- and three-dimensional) is realized using a special control space structure, responsible for delivery of a desired size and shape of mesh elements in any point of the discretized domain. There is presented an automated schema of discrete control space creation, taking into account a number of metric sources gathered automatically or obtained from the user. There are also presented numerous examples and experimental analysis of the computational and memory complexity of the subsequent phases of mesh generation and transformation.
