IMPLEMENTING 3 D NETWORK ANALYSIS IN 3 D-GIS

Way finding or routing has been always used by common people in navigating from one place (of origin) to another (destination). And most of them are in two dimensional routing or network. In orthogonal concept, two-dimensional (2D) or three-dimensional (3D) routing uses planar or non-planar graph and spatial extend, where the third dimension is used to calculate the weights for the edges in the graph. Usually routing is done in a planar graph embedded in 2D space. Sometimes it is extended to non-planar graphs to model bridges, etc. but still embedded in 2D space. Currently, most of shortest path algorithm used in GIS application is often not sufficient for efficient management in time-critical applications such as emergency response applications. It doesn’t take into account dynamic emergency information changes at node/vertex level especially when applying in emergency situations such as large fires (in cities or even in buildings), floods, chemical releases, terrorist attacks, road accidents, etc. This study is based on finding shortest path route in a dynamic situation for indoors and outdoors using Single Sink Shortest Path (SSSP) routing algorithm. The main focus of the research is to implement 3D shortest path analysis in 3D data set. A program is developed to calculate the shortest path in 3D data set with the support of dynamic events that might or will occur at each of calculated routes.

[1]  Daniel Holweg,et al.  FRAMEWORK FOR MULTI-RISK EMERGENCY RESPONCE , 2005 .

[2]  DemetrescuCamil,et al.  A new approach to dynamic all pairs shortest paths , 2004 .

[3]  Mei-Po Kwan,et al.  Emergency response after 9/11: the potential of real-time 3D GIS for quick emergency response in micro-spatial environments , 2005, Comput. Environ. Urban Syst..

[4]  Volker Coors,et al.  Using VRML as an interface to the 3D data warehouse , 1998, VRML '98.

[5]  Alias Abdul Rahman,et al.  Indoor and outdoor navigation based on 3D game engine , 2007 .

[6]  T. H. Kolbe,et al.  CityGML: Interoperable Access to 3D City Models , 2005 .

[7]  Volker Coors,et al.  GEOMETRICAL AND TOPOLOGICAL MODELS FOR REAL-TIME GIS , 2004 .

[8]  Thomas W. Reps,et al.  On the Computational Complexity of Dynamic Graph Problems , 1996, Theor. Comput. Sci..

[9]  S. Zlatanova,et al.  Evacuation Route Calculation of Inner Buildings , 2005 .

[10]  Giuseppe F. Italiano,et al.  A new approach to dynamic all pairs shortest paths , 2004, JACM.

[11]  S. Nebiker,et al.  APPLYING THE 3 D GIS DILAS TO ARCHAEOLOGY AND CULTURAL HERITAGE PROJECTS – REQUIREMENTS AND FIRST RESULTS , 2004 .

[12]  Stephan Nebiker.  Support for visualisation and animation in a scalable 3D gis environment - motivation, concepts and implementation , 2003 .

[13]  Giuseppe F. Italiano,et al.  Experimental analysis of dynamic all pairs shortest path algorithms , 2004, SODA '04.

[14]  Manfred M. Fischer,et al.  GIS and Network Analysis , 2004 .

[15]  Thomas H. Kolbe,et al.  Applications and Solutions for Interoperable 3d Geo-Visualization , 2003 .

[16]  Michael F. Goodchild.  Geographic information systems and disaggregate transportation modeling , 1998 .

[17]  W. Cao,et al.  The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, Vol. XXXVIII-4/C7 CLASSIFICATION OF HIGH RESOLUTION OPTICAL AND SAR FUSION IMAGE USING FUZZY KNOWLEDGE AND OBJECT-ORIENTED PARADIGM , 2010 .

[18]  J. Hagedorn.  Integrating urban GIS, CAD, and BIM data by service-based virtual 3D city models , 2007 .

[19]  K J Dueker,et al.  GIS-T ENTERPRISE DATA MODEL WITH SUGGESTED IMPLEMENTATION CHOICES , 1997 .

[20]  Alexander Köninger,et al.  3d-Gis for Urban Purposes , 1998, GeoInformatica.

[21]  Alias Abdul Rahman,et al.  Incorporating 3d game engine for 3d network analysis , 2007 .

[22]  F. Benjamin Zhan,et al.  Shortest Path Algorithms: An Evaluation Using Real Road Networks , 1998, Transp. Sci..

[23]  Volker Coors,et al.  Modeling dynamic weight for 3D navigation routing , 2007 .

[24]  Valerie King,et al.  Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[25]  Volker Coors,et al.  3D Navigation for 3D-GIS - Initial Requirements , 2006, 3D-GIS.

[26]  Yan Lei,et al.  Study on the real time navigation data model for dynamic navigation , 2005, Proceedings. 2005 IEEE International Geoscience and Remote Sensing Symposium, 2005. IGARSS '05..

[27]  Alexander Zipf,et al.  Generation of VRML city models for focus based tour animations: integration, modeling and presentation of heterogeneous geo-data sources , 2003, Web3D '03.

[28]  T. H. Kolbe,et al.  Towards unified 3D city models , 2003 .

[29]  Volker Coors,et al.  Integrating levels of detail in a Web-based 3D-GIS , 1998, GIS '98.

[30]  Michael F. Worboys,et al.  GIS : a computing perspective , 2004 .

[31]  Thomas W. Reps,et al.  An Incremental Algorithm for a Generalization of the Shortest-Path Problem , 1996, J. Algorithms.

[32]  T. H. Kolbe,et al.  The Virtual 3D City Model of Berlin-Managing, Integrating, and Communicating Complex Urban Information , 2006 .

[33]  S. Zlatanova.  3D GIS for urban development , 2000 .