20.500.12556/DKUM-42699 ALGORITMI ZA REŠEVANJE KOSOVNE SESTAVLJANKE Algorithms for solving the jigsaw puzzle 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. 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. kosovna sestavljanka usmerjeni graf umetna inteligenca jigsaw puzzle directed graph artificial intelligence. true true false [A. Prajndl] Slovenski jezik Angleški jezik Diplomsko delo 2013-10-07 13:24:15 2013-10-08 09:12:25 2022-05-08 03:05:26 2021-04-25 03:25:39 2013 0 Maribor 0 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 519.17(043.2) 17300246 URN:SI:UM:DK:8SFCZPVM VS_Prajndl_Andrej_2013.pdf VS_Prajndl_Andrej_2013.pdf 1 08C361D4DE53025EB3C98A5219AE84B6 14218ca5eefd06142675832f3271792d9d592799f4bef44dc7f504943198759d a62ee3d2-7c08-11eb-bb7a-00155d0001ca https://dk.um.si/Dokument.php?lang=slv&id=59946 Fakulteta za elektrotehniko, računalništvo in informatiko 0 0 0