[SoC] Gsoc 2013 Proposal :A partitioned approach to on demand increment graph assembly for pgRouting.

[Mukul priya]

Hi All,

I am applying for GSoC 2013 for pgRouting  . You can see the complete
proposal at melange[1].

Short Description:

** pgRouting has been working towards providing routing functionality on a
PostGis/PostgreSql Geo spatial database. It already has support for
shortest path algorithm like astar ,dijkstra , tdsp and trsp .But for a
very large network, routing becomes time consuming. Network partitioning is
one such way which can prove to be helpful in improving the overall time
efficiency of routing querries. The main idea here is to first partition
the whole network using a Quad tree approach and when the shortest path is
computed these partitions are loaded on demand. hence , there is an on
demand incremental graph generation while the shortest path is being
computed.

comments ,feedback and suggestion are welcome.

[1]
http://www.google-melange.com/gsoc/proposal/review/google/gsoc2013/mukul_priya/1


Regards

Mukul
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.osgeo.org/pipermail/soc/attachments/20130503/7c3f7a2d/attachment.html>