Abdul Rahman, Alias and Ujang, Muhamad Uznir (2007) Implementing Dijkstra shortest route for 3D indoor navigation system. In: Map Asia 2007, 14-16 August 2007, KL Convention Centre, Kuala Lumpur.
Restricted to Repository staff only
Network analysis such as finding shortest route is one of the important tools in GIS. 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 paper describes the investigation and implements the algorithm for 3D environment like 3D building or indoor situations. We developed the navigation system by using the inexpensive 3D game engine, called 3DState. A live demonstration of the system is part of the paper presentation. The approach works and could be extended for application including emergency and rescue operations, building management, and other 3D geoinformation applications.
|Item Type:||Conference or Workshop Item (Paper)|
|Uncontrolled Keywords:||Dijkstra algorithm, 3DState, 3D geoinformation|
|Subjects:||T Technology > TA Engineering (General). Civil engineering (General)|
|Divisions:||Geoinformation Science And Engineering (Formerly known)|
|Deposited By:||En. Tajul Ariffin Musa|
|Deposited On:||01 Jan 2008 01:22|
|Last Modified:||12 Apr 2012 00:31|
Repository Staff Only: item control page