• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Geometrinių objektų trianguliavimo metodai / Triangulation methods of geometry objects

Matonis, Mindaugas 06 June 2006 (has links)
Subject of this paper is triangulation of given domain also called as mesh generation. Overview of main mesh types (structured, unstructured and hybrid) is given. Groups of triangulation methods are defined and include collective triangulation, incremental triangulation, pliant mesh generation with post-triangulation and plaint mesh generation with retriangulation. Delaunay triangulation is described in greater detail and variuos Delaunay triangulation algorithms are presented including use of Delaunay triangulation for anisotropic mesh generation and method to generate Constrained Delaunay triangulation. Greedy insertion Delaunay and data dependent allgorithms are developed for hight fields surface aproximation. Significant improvements are made to these algorithms including faster recalculation, node selection and use of supplementary data sets in order to maximise efficiency of calculations. Main criteria to evaluate developed algorithms is overall error of approximation and speed of calculation. Data dependent algorithm generates better quality mesh (less approximation error), however Delaunay triangulation algorithm is significantly faster. Results and conclusions are presented at the end of paper.
2

Piršto antspaudo modelis minimaliais žiedais / Fingerprint model by minimum-width annuli

Liudkevič, Eduard 02 July 2014 (has links)
Šiame darbe yra nagrinėjamas piršto antspaudo atpažinimo uždavinio viena iš sudedamųjų dalių: skaitmeninės informacijos apie piršto antspaudą gavimas. Aprašomas metodas, paremtas kreivių kreivumų įvertinimu bei minimalaus žiedo sąvoka. Taip pat, aprašytas naujas Delaunė trianguliacijos radimo, minimalaus žiedo skaičiavimo bei kreivių kreivumų įvertinimo algoritmai. Darbo tikslas - pagerinti piršto antspaudo atpažinimo algoritmo kokybę, bei greitį. / The recognition of fingerprint is discussed in this article. The goal of this work is to increase the quality of fingerprint recognition method, and to improve algorithm speed. The new method of fingerprint data for fingerprint matching is analyzed. It concentrates on calculating values of curve curvatures, and minimum-width annuli. Some new methods of evaluation of this properties are described step by step.

Page generated in 0.2547 seconds