prikaz prve stranice dokumenta Problem najkraćih puteva na heksagonalnoj mapi
  Download
PDF 134.28 KB
master's thesis
Problem najkraćih puteva na heksagonalnoj mapi
Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2014. urn:nbn:hr:200:290588
Vekić, Vedrana
Josip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
Department of Software Engineering
Chair of Visual Computing

Cite this document

Vekić, V. (2014). Problem najkraćih puteva na heksagonalnoj mapi (Master's thesis). Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek. Retrieved from https://urn.nsk.hr/urn:nbn:hr:200:290588

Vekić, Vedrana. "Problem najkraćih puteva na heksagonalnoj mapi." Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2014. https://urn.nsk.hr/urn:nbn:hr:200:290588

Vekić, Vedrana. "Problem najkraćih puteva na heksagonalnoj mapi." Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2014. https://urn.nsk.hr/urn:nbn:hr:200:290588

Vekić, V. (2014). 'Problem najkraćih puteva na heksagonalnoj mapi', Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, accessed 20 April 2024, https://urn.nsk.hr/urn:nbn:hr:200:290588

Vekić V. Problem najkraćih puteva na heksagonalnoj mapi [Master's thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek; 2014 [cited 2024 April 20] Available at: https://urn.nsk.hr/urn:nbn:hr:200:290588

V. Vekić, "Problem najkraćih puteva na heksagonalnoj mapi", Master's thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, Osijek, 2014. Available at: https://urn.nsk.hr/urn:nbn:hr:200:290588

Please login to the repository to save this object to your list.
Metadata
TitleProblem najkraćih puteva na heksagonalnoj mapi
Title (english)Shortest paths problem on a hexagonal map
AuthorVedrana Vekić
MentorAlfonzo Baumgartner (mentor)
Committee memberAlfonzo Baumgartner (predsjednik povjerenstva)
Committee memberTomislav Keser (član povjerenstva)
Committee memberTomislav Rudec (član povjerenstva)
GranterJosip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
(Department of Software Engineering)
(Chair of Visual Computing)
Osijek
Defense date and country2014-10-03, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Process Computing
Abstract
U ovom radu opisano je i objašnjeno kako računalno naći najkraći put na heksagonalnoj mapi, od odabrane početne točke , do odabrane krajnje točke. Na početku rada objašnjeni su početni pojmovi – alati u kojima je izrađen program i sučelje. Potom je opisana sama izrada heksagonalnih elemenata. Riješenje problema izvedeno je u javaSkriptu. Traženje najkraćeg puta od jedne točke do druge na određenim površinama možemo naći u brojnim područijma, od znanosti pa do računalnih igara, te je interesantno proučiti kako se ponaša heksagonalna mapa za razliku od klasične kvadratne.
Abstract (english)
This paper describes and explains how to find the shortest path on the hexagonal map, from the selected start point, to the selected endpoint. At the beginning of the paper, initial concepts are explained - tools in which the application is made and the interface. Then it is described the actual making of hexagonal elements. Problem was solved using JavaScript. Search for the shortest path from one point to another in can be found in many areas of science and computer games, and it is interesting to study how it hexagonal map behaves, unlike classical square map.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:200:290588
Study programmeTitle: Graduate University Study Programme in Computer Engineering
Study programme type: university
Study level: graduate
Academic / professional title: magistar/magistra inženjer/inženjerka računarstva (magistar/magistra inženjer/inženjerka računarstva)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
RepositoryFaculty of Electrical Engineering, Computer Science and Information Technology Osijek
Created on2016-07-01 08:08:58