20.500.12556/DKUM-21596 ISKANJE POTI Z UPORABO PODATKOV IZ PODATKOVNE ZBIRKE OpenStreetMap PATH SEARCHING WITH USING DATA FROM OpenStreetMap V diplomskem delu predstavimo iskanja poti z uporabo podatkov iz podatkovne zbirke OpenStreetMap. Za boljše razumevanje tematike najprej opišemo geografske podatke in podatke iz podatkovne zbirke OpenStreetMap. V poglavju o iskanju poti predstavimo iskanje poti, zahteve, vrste in sestavo programov za iskanje poti ter algoritme in podatkovne strukture, ki jih potrebujemo. Opisano teoretično znanje smo uporabili pri programu Chartis, ki omogoča prikaz zemljevidov in iskanje poti. V poglavju o programu Chartis opišemo posebnosti in pasti, ki smo jih opazili pri implementaciji. Za iskanje poti z uporabo podatkovne zbirke OpenStreetMap že obstajajo obstoječe rešitve, kot so MoNav, Routino in Gosmore. Vsako izmed naštetih tudi predstavimo in jih skupaj s programom Chartis med seboj primerjamo. Primerjamo jih po treh kriterijih velikost podatkov potrebnih za iskanje, čas iskanja poti in razdalja oziroma primernost poti. This thesis describes path searching with using data from OpenStreetMap. It begins with describing geographical data in general and data from OpenStreetMap, which is needed to understand the topic. Furthermore, requirements for path searching, types of path searching, path searching structure, algorithms and data structures used in path searching are described in detail. All this knowledge was used to develop a computer program called Chartis. It is used for path searching and showing the maps. Experience gained at the implementation is documented and explained. There are several other applications that use OpenStreetMap data for path searching. The most popular are MoNav, Routino and Gosmore, which are briefly described. A comparison is given between all three and furthermore a comparison of them with Chartis is added. Comparison was done by evaluating the size of path searching data, CPU time to perform the search, and distance of the found path. iskanje poti najkrajša pot OpenStreetMap R-drevo Dijkstrov algoritem navigacija cestno omrežje path searching shortest path OpenStreetMap R-tree Dijkstra algorithm navigation road network true true false [T. Vajngerl] Slovenski jezik Angleški jezik Diplomsko delo 2011-12-08 12:36:24 2012-01-26 10:57:06 2022-04-14 10:43:33 2023-12-28 03:36:08 2011 0 Maribor 0 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 004.6:004.92(043.2) 15964438 URN:SI:UM:DK:R06YOUR5 VS_Vajngerl_Tomaz_2011.pdf VS_Vajngerl_Tomaz_2011.pdf 1 7B0852581BAC29E92B7443273D93A268 8b0c8486f57d3d2e366b089a157040a193ee4d02eb8b2239a91bda9195130246 e5653963-7c05-11eb-bb7a-00155d0001ca 20.500.12556/dkum/d4ca6f42-8c81-4241-955d-be270e860d2c https://dk.um.si/Dokument.php?lang=slv&id=27432 Fakulteta za elektrotehniko, računalništvo in informatiko 0 0 0