diplomsko delo visokošolskega strokovnega študijskega programa
Abstract
V diplomskem delu opišemo algoritme za reševanje kosovne
sestavljanke na osnovi primerjave robov. Razvili smo algoritem z
najboljšim prileganjem, algoritem gradnje po fronti ter algoritem z
usmerjenim grafom. Pri vseh algoritmih smo kot omejitve uvedli ravne
robove, pravilno orientacijo kosov, enako velikost kosov ter dodali
informacijo o statusu robnega in vogalnega kosa. Kriterija za primerjavo
algoritmov sta porabljen čas in pravilnost rezultata.
Keywords
kosovna sestavljanka;usmerjeni graf;umetna inteligenca;
Data
Language: |
Slovenian |
Year of publishing: |
2013 |
Typology: |
2.11 - Undergraduate Thesis |
Organization: |
UM FERI - Faculty of Electrical Engineering and Computer Science |
Publisher: |
[A. Prajndl] |
UDC: |
519.17(043.2) |
COBISS: |
17300246
|
Views: |
1163 |
Downloads: |
86 |
Average score: |
0 (0 votes) |
Metadata: |
|
Other data
Secondary language: |
English |
Secondary title: |
Algorithms for solving the jigsaw puzzle |
Secondary abstract: |
In the thesis we describe the algorithms for solving a jigsaw puzzle
based on the edge comparison. We developed best fit algorithm, the
algorithm with front construction, and the algorithm with directed
graph. For all algorithms we used limitations like straight edges,
correctly rotated pieces, and same size for all pieces. Information about
border and edge pieces was added. The main criteria for algorithm
comparison are puzzle solving time and quality of the result. |
Secondary keywords: |
jigsaw puzzle;directed graph;artificial inetelligence; |
URN: |
URN:SI:UM: |
Type (COBISS): |
Undergraduate thesis |
Thesis comment: |
Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko |
Pages: |
VIII, 30 f. |
ID: |
8727217 |