Abstract—In this paper, the researchers have presented a Spatial Database Model for Geometric Path Planning suitable for facilitating Disaster Management activities. The spatial queries executed using the proposed approach can reduce the computational time needed to find an optimal collision free path for network analysis. The framework is applicable to 2-dimensional and 3-dimensional workspaces. The strategy used decouples the motion planning problem into small tractable problems, which are solved using know path planning algorithm. Index Terms—Avoidance, disaster management, path planning, query processing, spatial database, visibility graph. I. INTRODUCTION A. Geo-Spatial Database Model To understand the real world, its characteristic features must be studied and modeled. In the real world features are described by some descriptive terms, by physical location and by their ability to connect both physically and logically to other features. Thus a ―road feature‖ could be described by attributes (name and length), by geometry (its physical location), by topology (how it is physically connected to other features) and by join relationships (its logical connections with other features). B. Geometric Path Planning Geometric Path planning are geometrical methods used for computing a collision or obstacle free path connecting the initial and final point in 2D and 3D environments. Given a mapping and a description of the obstacles they provide a geometric description of the path in the workspace. Advantages of using geometrical descriptions are obstacles can be represented by arbitrary polygons, arbitrary motion angles. Also it is possible to find optimal paths for circular objects using topological abstractions. Successful attempts are made to reduce the computation time needed to find an optimal collision-free path for robot motions [1], [2]. C. Review of Related Literature Existing geo-spatial database models consider only fixed obstacles in 2-dimension workspace. In-2 dimensional work space motion plan from p start to p end does not cross the interior of any obstacles O. Even the visibility graph is pre- computed and maintained in the memory thereby occupying the Manuscript received April 14, 2012; revised June 28. S. U. Purohit is with Department of Mathematics, Kirti College and Department of Technology and Mgmt, NMITD, Mumbai, India (e–mail: supurohit@gmail.com). S. D. Mantri is with Department of Computer Science, University of Mumbai, India. (e-mail: shrutimantri@gmail.com). memory space. In-3 dimensional work space obstacles with significant height can be considered, since the path can go over obstacles and not just around them. Hence we need an Integrated Frame work that is applicable to 2-dimensional and 3-dimensional workspace and computes the visibility graph in a dynamic environment [3]. D. Obstacle Identification Obstacle in geometrical path planning refers to obstruction or blockage that arises in finding or traversing the path. Natural and created objects in geometric path planning problems are usually divided into moving and fixed objects called as obstacles. In many applications, physical obstacles like mountains, rivers, water logging, disaster sites etc substantially affect the geometric path planning. In our paper we have classified obstacles as natural obstacles and created obstacles. Natural obstacles are those obstacles that cannot be moved and altered such as such as rocks, sea, stream, ledges and mountains. Created obstacles are those obstacles that are formed mainly due to environmental and geographic changes such as water logging formed due to improper land elevation. Pedestrian movement, public buildings, indoor areas, vehicles navigating through narrow lanes restricting the traffic and disaster affected sites can also be classified as created obstacles. In real world most obstacles are not fixed but movable. A human planner would take into account that he can move these obstacles to solve geometric path planning problem. Ignoring these obstacles will affect the performance of geometric path planning algorithms, clustering algorithms and produce inappropriate results. Thus the ability to handle such real life constraints in a Geo-Spatial Data model is very important. E. Disaster Management Disaster management is skillful handling of crisis, danger or an unexpected situation demanding instant action which can be handled under a controlled situation in case of a juncture. It is a cycle of activities beginning with planning the Disaster Management plan, mitigating the vulnerability and negative impacts of disasters, preparedness in responding to operations, responding and providing relief in emergency situations such as search and rescue, etc. F. Importance of Geometric Path Planning in Disaster Management System During the disaster response phase, response activities are designed to provide disaster assistance for victims. Disaster response activities can be facilitated by providing the best route and closest facility required at the time of emergencies. Best Route means the shortest/fastest geometrical path to be identified among different alternate paths available in different situations. For example, while people are affected Facilitation of Spatial Database Model for Disaster Management Seema U. Purohit and Shruti D. Mantri International Journal of Modeling and Optimization, Vol. 2, No. 4, August 2012 472