<div dir="ltr"><p style="text-align:center"><span style="font-size:x-small"> </span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><strong> </strong><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><strong>Name</strong>:Mukul Priya<br class="">
<br class=""><strong>Country:</strong>India<br class=""><br class=""><strong>School and degree</strong>: International Institute Of Information Technology-Hyderabad ,</span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr">
<span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> B.Tech + Masters in computer Science And Engineering <br class="">
<br class=""><strong>Email</strong>:<a href="mailto:mukul2047@gmail.com">mukul2047@gmail.com</a><br class=""><br class=""><strong>Phone</strong>:+91 9885991061<br class=""><br class=""><strong>OSGeo project(s</strong>):pgRouting<br class="">
<br class=""><strong>Title:</strong> A partitioned approach to on demand increment graph assembly for pgRouting.</span></p><p style="text-align:left"><span style="font-size:x-small"> </span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr">
<span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><strong> Describe your idea</strong><br class="">
<strong>1. Introduction</strong></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> </span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> pgRouting has been working towards providing routing functionality on a PostGis/PostgreSql Geo spatial</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> database. It already has support for shortest path algorithm like astar ,dijkstra , tdsp and trsp .But for a very</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> large network, routing becomes time consuming. Network partitioning is one such way which can prove to</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> be helpful in improving the overall time efficiency of routing querries. The main idea here is to first partition</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> the whole network using a Quad tree approach and when the shortest path is computed these partitions are</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> loaded on demand. hence , there is an on demand incremental graph generation.</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br>
</span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> The project aims at designing and implementing a Shortest Path algorithm on an on demand incremental</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> Graph using a network partitioning approach.</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><br><br><strong><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">2. Background</span></strong></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> </span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> Considering the present status where pgRouting has support for shortest path algorithm like astar etc.</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> Looking at their implementation details we can observe that the graph is configured dynamically for all</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> of them before computation.My proposal will also be on the same track and for very large networks</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> where the distance between source and destination can be very large , the response time will be</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> significantly lesser and memory wise too it will be lot more efficient. Presently they don't use any partitioning</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> approach so it will prove to be a good addition to their support for shortest past algorithms.</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><br><strong><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">3. The idea</span></strong></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> </span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> There are two major components of my idea .</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br>
</span></p><ul style="margin-top:0pt;margin-bottom:0pt;text-align:left"><li style="font-size:15px;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline" dir="ltr">
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt" dir="ltr"><strong><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">Network Partitioning</span></strong></p>
</li></ul><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> For this part we can use a quad tree approach. Say , we start with a square and a condition like maximum</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> number of nodes that can reside in a square . if the number of nodes in the square is greater than the max</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> condition we further quarter it into four squares and allot the nodes appropriately to each of them.All these</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> squares can be called grids and they all will be addressed uniquely using a grid cell number .Each node</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> will be assigned a grid cell number based on the grid they are lying inside.</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> </span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br>
</span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> We will have data structures to address edges as they can remain contained in either one grid cell</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> or span across a number of grid cells.the idea is to first flag such edges and store the grid cell numbers</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> of the grids that the edge crosses/intersects.</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br>
</span></p><ul style="margin-top:0pt;margin-bottom:0pt;text-align:left"><li style="font-size:15px;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline" dir="ltr">
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt" dir="ltr"><strong><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">On demand graph generation and Routing.</span></strong></p>
</li></ul><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> </span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> The idea here is to first identify the grid cell initially and then fetch the edges that are associated with </span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> that grid. These are the edges that will get appended to the present graph and the graph will keep growing</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> dynamically this way. we will have appropriate database tables addressing the above issue such that</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> we are able to fetch the required edges quickly using a database querry.</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br>
</span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> The implementation details for the above are :</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> we will first partition the whole graph using the quad tree approach and each node/vertex will be assigned</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> a grid cell number so we can have database table for the assigned nodes and edges like :</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> </span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> CREATE TABLE vertex{</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> id Node_id \\ unique for each node.</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> cell grid_cell_number; \\ the grid in which the node lies.</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> geometry;</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> }</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><br><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> CREATE TABLE edge {</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> int id ;</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> Int node_a;</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> int node_b; \\ the connecting nodes </span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> // we can have other parameters like traversal cost and return cost.</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> }</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> </span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> using the tables we can then fetch the edges form edge table using simple database querry once</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> we are provided with the grid cell number very easily.</span></p>
<p style="text-align:left"><span style="font-size:x-small"> </span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> In short the summary of the whole idea is :</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br>
</span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">Step1: Fetch the start node , get the related Grid cell number.</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br>
</span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">Step 2: Increment the graph by fetching all the items related to that grid.</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br>
</span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">Step3 : Check for boundary nodes ( this is done while we are partitioning) or target node .</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> </span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> Step 4: On hitting a boundary node</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> {</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> check if the connected grid is loaded and continue if it is</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> or we extend the graph with the new grid and continue with the routing;</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> }</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> or On hitting the target Node</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> {</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> stop;</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> }</span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small;font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> </span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><br><br><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><strong>4. Project plan</strong> </span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> I will have about 12 weeks to implement the project. The tentative schedule is as follows:</span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> </span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> Before 17th June : Get familiar with the development environment of pgRouting and test some demos.<br>
</span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> </span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> week 1-2: Discuss and Define the various data structures and data table that will be required.Prepare the </span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> Overall implementation architecture.</span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br>
</span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> week 3-4- Discuss and Implement network partitioning using quad tree. </span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> </span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> week 5-8 -Start coding for on demand graph generation and routing using Dijkstra. In between Prepare mid-term</span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> report.<br>
</span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> <br>
</span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> week 9 - Integration with pgrouting .</span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> </span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> week 10-12- Testing and Bug fixing. Draft Final report and documentation. <br>
</span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> <br>
</span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><strong><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> <br class="">
5. Future ideas / How can your idea be expanded? </span></span></strong></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br>
</span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> It can be integrated with other shortest path algorithms like astar etc. which pgrouitng provides.For time dependent</span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> shortest path computation, it will greatly reduce the updating cost as we will be updating the cost of only those edges </span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> that are contained in the grid cells that are loaded. </span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> In route nearest neigbour querries can also be implemented using the partitioning approach.Overall we can </span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> expand this approach to various other algorithms. <br class="">
<br class=""><strong>Explain how your SoC task would benefit the OSGeo member project and more generally the OSGeo Foundation as a whole:</strong></span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr">
<span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> </span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> The proposed idea will significantly improve the performance of shortest path finding algorithms.This will have a </span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> positive effect on the user base of pgRouting. For various software paltforms or applications that are using this library ,</span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"> the response time will significantly improve.<br>
</span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><strong><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br class="">
<br class="">Please provide details of general computing experience:<br class=""> </span></span></strong></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br>
</span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">I
generally use ubuntu ( 12.04) for all my academic purposes and windows 7
for entertainment only. I am familiar with Fedora also.</span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">C++
is the language that i use most ( programming purposes). For
implementing various course projects i have used C++ ,python ,Java and
matlab. </span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br>
</span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">I have no experience with hardware. The only experience that i had with networking was during my computer network course. <br>
</span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><strong><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br class="">
Please provide details of previous GIS experience:</span></span></strong></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br>
</span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">I
am a part of "Lab for Spatial Informatics" which is the only lab in
India devoted to GIS applications and learning. I am familiar with and
have used almost all the open source GIS platforms like Quantum ,
OpenJump, ILwis,Grass. We have our own rendering platform that was
developed by our lab.(LSI viewer)<br class=""><br class=""><strong>Please provide details of any previous involvement with GIS programming and other software programming:</strong></span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr">
<span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br></span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">I am very much familiar with Gdal/OGR as i used it extensively while implementing an outsourced project of Honeywell</span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">Technology . I have played a lot with ESRI shape files.<br class="">
<br class=""><strong>Please tell us why you are interested in GIS and open source software:</strong></span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br>
</span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">I
was very impressed with google earth when it was launched way back in
2004.GIS platforms like quantum and Openjump were introduced to me when
i was in my second year and then i joined Lab for spatial informatics
that is in our college based on my interest in this area.<br></span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br>
</span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">open
source platforms provide an opportunity to learn . The best part is you
can always create or develop something that you are interested in and
there are people who will always be there to help you if you are stuck.<br></span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><strong><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br class="">
<br class="">Please tell us why you are interested in working for OSGeo and the software project you have selected:</span></span></strong></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr">
<span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br></span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">It will be huge learning experience since i have been using platforms like Qgis , Gdal ,PostGis etc which come under Osgeo <br>
</span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br>
</span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">I
chose pgrouting because the algorithms that they have implemented are
related to my masters topic and it will be great if i get an insight
about how these were implemented on a much larger scale. <br class=""><br class=""><strong>Please tell us why you are interested in your specific coding project:</strong></span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr">
<span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br></span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">Implementing
routing algorithms for real world networks is actually very
challenging.its a challenge to come up with good approaches so that the
computation cost and response time is both reduced.<br class=""><br class=""><strong>Would your application contribute to your ongoing studies/degree? If so, how?</strong></span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr">
<span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">I
am pursuing my Masters and my topic is closely related to my proposal .
If the results are impressive , i might get a publication in this area.<br></span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br class="">
<strong>Please explain how you intend to continue being an active member of your project and/or OSGeo AFTER the summer is over:</strong></span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr">
<span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br></span></span></p>
<p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">I
was always interested in open source programming but never knew where
to start . GSOC provides an opportunity for beginners like me to take a
dive in the area open source programming. i have other ideas like
implementing IRNN ( In route nearest neighbour querries) which can be
implemented within pgRouting.I have other intentions like working for
bigger projects like Quantum Gis or Grass.I will be contributing to the
community forum and will always try to improve things.<br class=""><br class=""><strong>Do you understand this is a serious commitment, equivalent to a full-time paid summer internship or summer job?</strong><br class="">
</span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br>
</span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">Yes, I understand that this is a serious commitment and will try to give my best and work in a professional manner. <br>
</span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br class="">
<strong>Do you have any known time conflicts during the official coding period? (June 17 to Sept. 27)</strong></span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline"><br>
</span></span></p><p style="line-height:1.15;margin-top:0pt;margin-bottom:0pt;text-align:left" dir="ltr"><span style="font-size:x-small"><span style="font-family:Arial;color:rgb(0,0,0);background-color:transparent;font-weight:normal;font-style:normal;font-variant:normal;text-decoration:none;vertical-align:baseline">No .<br>
</span></span></p><p style="text-align:left"><br><br></p><p style="text-align:left"><span style="font-size:x-small"> </span></p><p style="text-align:left"><span style="font-size:x-small"> </span></p><p style="text-align:left">
<span style="font-size:x-small"> </span></p></div><div class="gmail_extra"><br><br><div class="gmail_quote">On Thu, Apr 25, 2013 at 12:47 AM, Stephen Woodbridge <span dir="ltr"><<a href="mailto:woodbri@swoodbridge.com" target="_blank">woodbri@swoodbridge.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div class="im">On 4/24/2013 2:34 PM, Mukul priya wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
Hi Steve and Daniel ,<br>
<br>
I have posted my proposal on Melange Gsoc system. Do have a look at it.<br>
Waiting for feedback and suggestions.<br>
</blockquote>
<br></div>
Can you post a link to your proposal? or the text of it here also. I can never find anything in Melange or I may not have visibility to it yet as I just applied as a mentor.<br>
<br>
Thanks,<br>
-Steve<br>
______________________________<u></u>_________________<br>
pgrouting-dev mailing list<br>
<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">pgrouting-dev@lists.osgeo.org</a><br>
<a href="http://lists.osgeo.org/mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/<u></u>mailman/listinfo/pgrouting-dev</a><br>
</blockquote></div><br></div>