Implementing shortest path calculation for 3D navigation system
Shortest path analysis is one of a significant tool in GIS. Several algorithms can be used to utilize the analysis. Dijkstra’s algorithm has proven its capability in providing two-dimensional (2D) shortest route information. However, there are few attempts to fi...
à®®à¯à®´à¯ விளகà¯à®•à®®à¯
Saved in:
| தலைமை எழà¯à®¤à¯à®¤à®¾à®³à®°à¯à®•à®³à¯: | , |
|---|---|
| வடிவமà¯: | Book Section |
| மொழி: | English |
| வெளியீடபà¯à®ªà®Ÿà¯à®Ÿà®¤à¯: |
Penerbit UTM
2008
|
| பகà¯à®¤à®¿à®•à®³à¯: | |
| நிகழà¯à®¨à®¿à®²à¯ˆ அணà¯à®•à®²à¯: | http://eprints.utm.my/22026/ http://eprints.utm.my/22026/1/MuhamadUznirUjang2008_ImplementingShortestPathCalculationfor3D.pdf |
| கà¯à®±à®¿à®¯à¯€à®Ÿà¯à®•à®³à¯: |
கà¯à®±à®¿à®šà¯à®šà¯Šà®²à¯ இணை
கà¯à®±à®¿à®¯à¯€à®Ÿà¯à®•à®³à¯ இலà¯à®²à¯ˆ, இநà¯à®¤ கà¯à®±à®¿à®šà¯à®šà¯Šà®²à¯à®²à¯ˆ à®®à¯à®¤à®²à®¿à®²à¯ பதிவ௠செயà¯à®¯à¯à®™à¯à®•à®³à¯!
|
| தொகà¯à®ªà¯à®ªà¯: | Shortest path analysis is one of a significant tool in GIS. Several algorithms can be used to utilize the analysis. Dijkstra’s algorithm has proven its capability in providing two-dimensional (2D) shortest route information. However, there are few attempts to fit the algorithm for three-dimensional (3D) shortest routes. This chapter describes the investigation and implements the algorithm for 3D environment like 3D building for indoor situations. The developed navigation system used a 3D navigational game engine. The approach works and could be extended for application including emergency and rescue operations, building management, facility management and other 3D geo-information situations. |
|---|