master's thesis
Shortest paths problem on a hexagonal map

Vedrana Vekić (2014)
Sveučilište Josipa Jurja Strossmayera u Osijeku
Fakultet elektrotehnike, računarstva i informacijskih tehnologija Osijek
Zavod za programsko inženjerstvo
Katedra za vizualno računarstvo
Metadata
TitleProblem najkraćih puteva na heksagonalnoj mapi
AuthorVedrana Vekić
Mentor(s)Alfonzo Baumgartner (thesis advisor)
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.
Keywordshexagon hexagonal map finding the shortest path HTML JavaScript LESS CSS jQuery
Parallel title (English)Shortest paths problem on a hexagonal map
Committee MembersAlfonzo Baumgartner (committee chairperson)
Tomislav Keser (committee member)
Tomislav Rudec (committee member)
GranterSveučilište Josipa Jurja Strossmayera u Osijeku
Fakultet elektrotehnike, računarstva i informacijskih tehnologija Osijek
Lower level organizational unitsZavod za programsko inženjerstvo
Katedra za vizualno računarstvo
PlaceOsijek
StateCroatia
Scientific field, discipline, subdisciplineTECHNICAL SCIENCES
Computing
Process Computing
Study programme typeuniversity
Study levelgraduate
Study programmeGraduate University Study Programme in Computer Engineering
Academic title abbreviationmag.ing.comp.
Genremaster's thesis
Language Croatian
Defense date2014-10-03
Parallel 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.
Parallel keywords (Croatian)heksagon heksagonalna mapa pronalazak najkraćeg puta HTML JavaScript LESS CSS jQuery
Resource typetext
Access conditionOpen access
Terms of usehttp://rightsstatements.org/vocab/InC/1.0/
URN:NBNhttps://urn.nsk.hr/urn:nbn:hr:200:290588
CommitterAnka Ovničević