PENCARIAN RUTE TERPENDEK DALAM DUNIA 3 DIMENSI BERDASARKAN ALGORITMA DIJKSTRA

Abstract

/* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-qformat:yes; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin-top:0cm; mso-para-margin-right:0cm; mso-para-margin-bottom:10.0pt; mso-para-margin-left:0cm; line-height:115%; mso-pagination:widow-orphan; font-size:11.0pt; font-family:"Calibri","sans-serif"; mso-ascii-font-family:Calibri; mso-ascii-theme-font:minor-latin; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast; mso-hansi-font-family:Calibri; mso-hansi-theme-font:minor-latin; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi;} Virtual reality is one of the favorite application that very liked by peoples. Vitual reality also used in many games application in order to show the imitation of real world. Recently, virtual reality still imperfect due to shortest path problem. It need more accuration enhancement to get a very good refelection of the real world. This paper intends to discuss how to enhance the accuration of virtual reality shortest path tracking by utilizing Dijkstra algorithm. The built up prototype has three abilities: visualization, simulation fo campus traffic, and exploration of campus world in 3D ways. Keywords: 3D, virtual reality, dijkstra