Šiame darbe yra trumpai aprašomas algoritmas, kuris naudoja nereikalingus skaičiavimus, ieškant iškilojo apvalkalo taškų. Pateikiamas naujas „Artimiausio taško“ algoritmas, kuris iškilojo apvalkalo taškus randa įterpimo būdu. Pateikiamos ir dvi „Artimiausio taško“ algoritmo realizacijos. „Preparata“ bei „Artimiausio taško“ algoritmai, bei „Artimiausio taško“ algoritmo dvi realizacijos realizuojamos skirtingose operacinėse sistemose: Windows ir Linux. Realizavus algoritmus („Preparata“, „Artimiausio taško“) ir dvi „Artimiausio taško“ algoritmo realizacijas, buvo analizuojamas algoritmų atlikimo laikas. / This work shortly describes the algorithms, that uses unnecessary calculations for the search of convex hull points. A new algorithm called “Nearest point” is presented in this work. This algorithm founds the points of convex hull by using the method of insertion. Two realisations of the “Nearest point” realisation are presented in the current work.. The “Preparata” algorithm, the “Nearest point” algorithm, and two realisations of the “Nearest point” algorithm were build both for Windows and Linux operating systems. After the realisation of the algorithms (“Preparata” and “Nearest point”) and two versions of the “Nearest point”, the action time of them has been analysed.
| Identifer | oai:union.ndltd.org:LABT_ETD/oai:elaba.lt:LT-eLABa-0001:E.02~2008~D_20080924_181002-26987 |
| Date | 24 September 2008 |
| Creators | Andrejev, Andrej |
| Contributors | Kazlauskas, Kazys, Nekrašaitė, Kristina, Dzemyda, Gintautas, Kligienė, Nerutė, Lipeikienė, Joana, Petkus, Tomas, Melničenko, Grigorijus, Vilnius Pedagogical University |
| Publisher | Lithuanian Academic Libraries Network (LABT), Vilnius Pedagogical University |
| Source Sets | Lithuanian ETD submission system |
| Language | Lithuanian |
| Detected Language | English |
| Type | Master thesis |
| Format | application/pdf |
| Source | http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2008~D_20080924_181002-26987 |
| Rights | Unrestricted |
Page generated in 0.0017 seconds