| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:ISKANJE POTI Z UPORABO PODATKOV IZ PODATKOVNE ZBIRKE OpenStreetMap
Authors:ID Vajngerl, Tomaž (Author)
ID Žalik, Borut (Mentor) More about this mentor... New window
Files:.pdf VS_Vajngerl_Tomaz_2011.pdf (5,33 MB)
MD5: 7B0852581BAC29E92B7443273D93A268
PID: 20.500.12556/dkum/d4ca6f42-8c81-4241-955d-be270e860d2c
 
Language:Slovenian
Work type:Undergraduate thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract: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.
Keywords:iskanje poti, najkrajša pot, OpenStreetMap, R-drevo, Dijkstrov algoritem, navigacija, cestno omrežje
Place of publishing:Maribor
Publisher:[T. Vajngerl]
Year of publishing:2011
PID:20.500.12556/DKUM-21596 New window
UDC:004.6:004.92(043.2)
COBISS.SI-ID:15964438 New window
NUK URN:URN:SI:UM:DK:R06YOUR5
Publication date in DKUM:26.01.2012
Views:2634
Downloads:198
Metadata:XML DC-XML DC-RDF
Categories:KTFMB - FERI
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:English
Title:PATH SEARCHING WITH USING DATA FROM OpenStreetMap
Abstract: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.
Keywords:path searching, shortest path, OpenStreetMap, R-tree, Dijkstra algorithm, navigation, road network


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica