Global ETD Search

1	Iškilojo taškų aibės apvalkalo algoritmų tyrimas / Investigation of the convex hull Vyšniauskaitė, Laura 19 June 2006 (has links) All possible convex hull (i.e. the minimum area convex polygon containing the planar set) algorithms ever published in scientific press have been analysed in this work. Two new convex hull algorithms created by myself have been presented. The running time of analysed algorithms has been surveyed. Three most popular algorithms (Graham Scan, Jarvis March and Quickhull), the oldest algorithm (Brute Force) as well as the both new ones have been implemented. Efficiency experiments have been carried out with them. The algorithms created by me achieved the best results. In order to raise the efficiency of all the algorithms I suggested a priori filtration of points, which decreases the amount of the original points by almost 50% and, consequently, the speed of algorithms is increased. The major part of this master work will be published in the magazine “Technological and economic development of economy”. Besides, the report of this work has been made in the conference of Lithuanian young scientists, called “Operation analysis and application”. Informatics Apriorinis taškų filtravimas A priori filtration of points Iškilusis apvalkalas Convex hull
2	Iškilojo apvalkalo taškų radimo algoritmai / Algorithms for finding the convex hull of set of points Norkūnaitė, Aušra 16 August 2007 (has links) Šiame darbe yra trumpai aprašomi algoritmai, kurie naudoja nereikalingus skaičiavimus, ieškant iškilojo apvalkalo taškų. Pateikiamas naujas „Radaro“ algoritmas, kuris iškilojo apvalkalo taškus randa išrinkimo būdu. Pateikiamos ir trys „Radaro“ algoritmo realizacijos. Graham, Jarvi, „Radaro“ algoritmai bei „Radaro“ algoritmo trys realizacijos realizuojamos dvejais būdais: statiniais masyvais ir dinaminiais masyvais. Realizavus tris algoritmus (Graham, Jarvi, „Radaro“) ir tris „Radaro“ algoritmo realizacijas, buvo analizuojamas algoritmų atlikimo laikas. / There are shortly presented algorithms which use unnecessary calculations in order to find convex hull. In this work you can discover new “Radar” algorithm which finds convex hull by using selecting method and three ways of realization of this algorithm. Graham, Jarvi, “Radar” algorithms and three ways of realization of “Radar” algorithm are realized in two ways: static array and dynamic array. There were analyzed time needed for execution of three algorithms (Graham, Jarvi and “Radar”) and three ways of realization of “Radar” algorithm. Informatics "Radaro" algoritmas Iškilusis apvalkalas Graham Jarvi Graham Jarvi “Radar” Convex hull
3	Dinaminės duomenų struktūros ir kai kurių jų algoritmų realizavimas rodyklėmis / Dynamic Data Structures And The Realisation Of Some Algorithms By Pointers Suchaževskaja, Tatjana 08 June 2005 (has links) The present research paper deals with the comparison of static and dynamic data structures: static array, dynamic array, pointers array - class TList (Delphi) and dynamic doubly linked list, created with the help of recursive record.To compare the above mentioned structures, sorting (Bubble) and convex hull creation algorithms (Graham, Endrew) are realized, with the time of their implementation analysed. The algorithm of sorting (Bubble) is realized by four ways: static array, dynamic array, pointers array (class TList) and a dynamic doubly linked list, created with the help of recursive record.The algorithms of convex hull creation (Graham, Endrew) is realized by three ways: static array, dynamic array and pointers array (TList).The research paper also describes the pointers array class TList (Delphi), its properties and methods. The sorting method Sort of this class is compared with the sorting method of a “Bubble”. Using class templates, a universal class MList (C++) was created for work with dynamic linear linked lists. Informatics Delphi Klasė Rikiavimas Static data structures Static array Convex hull Rodyklių masyvas Sąrašas List Class Dinaminis masyvas Iškilusis apvalkalas Endrew Linear linked list Dinaminės duomenų struktūros Sort Pointers array Graham Bubble C++ Dynamic doubly linked list Dynamic array Dynamic data structures Tiesinis sąrašas TList

1

Page generated in 0.0405 seconds