20.500.12556/RUL-112556 Najkrajša pot in pot z najmanj ovinki delo diplomskega seminarja Shortest path and minimal link path V diplomski nalogi opišemo algoritem za iskanje najkrajše poti v večkotniku in algoritem za iskanje poti z najmanj ovinki. Algoritma delujeta v večkotniku, katerega triangulacijo že poznamo. Prvi algoritem direktno uporablja triangulacijo. Drugi algoritem pri iskanju poti z najmanj ovinki poišče večkotnike vidljivosti. Pri tem si pomaga z najkrajšo potjo iz prvega algoritma. Opišemo tudi več algoritmov za konstruiranje večkotnikov vidljivosti. Algoritem za najkrajšo pot sem tudi implementiral v obliki mobilne aplikacije. In this thesis we describe an algorithm for computing the shortest path between two points in a simple polygon and an algorithm for computing a minimum link path between two points in a simple polygon. Both algorithms require that a triangulation of the polygon is already given. The first algorithm uses the triangulation directly, while the algorithm for the minimal link path makes use of the shortest path already computed with the first algorithm in order to compute visibility polygons. We also describe several algorithms for computing visibility polygons. I also implemented the algorithm for computing shortest path as a mobile application. najkrajša pot pot z najmanj ovinki triangulacija večkotnik vidljivosti večkotnik shortest path minimum link path triangulation visibility polygon polygon true false false Slovenski jezik Angleški jezik Delo diplomskega seminarja/zaključno seminarsko delo/naloga 2019-10-24 09:47:04 2019-10-24 09:47:05 2024-05-30 10:18:23 0000-00-00 00:00:00 2019 0 0 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 519.1 104866 18771033 DIP_Lajovic_Luka_2019.pdf DIP_Lajovic_Luka_2019.pdf 1 94868D0C2077A0CD7DF84709EFF4F711 ae40ea3da2b07e9afb7ac957905b36ddb857eb407d3250ba5643d4ae87c368f9 e790ec1d-a1b7-11eb-a523-00155dcfd717 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=124453 Fakulteta za matematiko in fiziko 0 0 0