Boost.Graph for GSoC
Hi all, I'm a researcher and graduate student at the University of Texas at Austin and I'm interested in doing a Boost.Graph project for GSoC. I was thinking of doing one or more planar graph algorithms, in particular the multiple source shortest paths algorithm for planar graphs described at http://courses.csail.mit.edu/6.889/fall11/lectures/L11.html The algorithm assumes that the sources are located on a single face. It proceeds by calculating the shortest paths tree from one source and then minimally modifying the tree to efficiently get the shortest paths from the other sources. The algorithm uses a dynamic tree data structure, so developing that data structure would be part of the project too. I've made prior contributions to BGL. I worked with Doug Gregor to implement color maps for the breadth first and Dijkstra's algorithms. One of my current areas of research is movement ecology, where planar graphs can be used to study movement. Let me know what you think. Daniel Mitchell
Just want to follow up on Daniel's post. Daniel works in my lab and is an exceptionally good C++ programmer. I am available to mentor. This work is in collaboration with Philip Kein at Rutgers who is writing a book on planar graph algorithms. I will ask Phil if he is interested in co-mentoring. THK On Mon, Apr 8, 2013 at 11:32 AM, Daniel Mitchell < dlm.bulk.messages@gmail.com> wrote:
Hi all, I'm a researcher and graduate student at the University of Texas at Austin and I'm interested in doing a Boost.Graph project for GSoC. I was thinking of doing one or more planar graph algorithms, in particular the multiple source shortest paths algorithm for planar graphs described at
http://courses.csail.mit.edu/6.889/fall11/lectures/L11.html
The algorithm assumes that the sources are located on a single face. It proceeds by calculating the shortest paths tree from one source and then minimally modifying the tree to efficiently get the shortest paths from the other sources. The algorithm uses a dynamic tree data structure, so developing that data structure would be part of the project too.
I've made prior contributions to BGL. I worked with Doug Gregor to implement color maps for the breadth first and Dijkstra's algorithms. One of my current areas of research is movement ecology, where planar graphs can be used to study movement.
Let me know what you think.
Daniel Mitchell
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
On Monday, April 08, 2013 11:40:48 AM Tim Keitt wrote:
Just want to follow up on Daniel's post. Daniel works in my lab and is an exceptionally good C++ programmer. I am available to mentor. This work is in collaboration with Philip Kein at Rutgers who is writing a book on planar graph algorithms. I will ask Phil if he is interested in co-mentoring.
this sounds like a good and valueable project to me. I'd just like to mention that it would have been nice if you came up with that 2 weeks ago already and added it to the boost gsoc projects page. There is some competition to get into GSoC as a mentoring organization and the more project ideas boost provides the more likely it gets supported... However, google is just posting the list of accepted organizations and boost is in, so we are fine on that :) https://google-melange.appspot.com/gsoc/org/google/gsoc2013/boost Mario
THK
On Mon, Apr 8, 2013 at 11:32 AM, Daniel Mitchell <
dlm.bulk.messages@gmail.com> wrote:
Hi all, I'm a researcher and graduate student at the University of Texas at Austin and I'm interested in doing a Boost.Graph project for GSoC. I was thinking of doing one or more planar graph algorithms, in particular the multiple source shortest paths algorithm for planar graphs described at
http://courses.csail.mit.edu/6.889/fall11/lectures/L11.html
The algorithm assumes that the sources are located on a single face. It proceeds by calculating the shortest paths tree from one source and then minimally modifying the tree to efficiently get the shortest paths from the other sources. The algorithm uses a dynamic tree data structure, so developing that data structure would be part of the project too.
I've made prior contributions to BGL. I worked with Doug Gregor to implement color maps for the breadth first and Dijkstra's algorithms. One of my current areas of research is movement ecology, where planar graphs can be used to study movement.
Let me know what you think.
Daniel Mitchell
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
On Monday, April 08, 2013 03:19:01 PM Mario Mulansky wrote:
On Monday, April 08, 2013 11:40:48 AM Tim Keitt wrote:
Just want to follow up on Daniel's post. Daniel works in my lab and is an exceptionally good C++ programmer. I am available to mentor. This work is in collaboration with Philip Kein at Rutgers who is writing a book on planar graph algorithms. I will ask Phil if he is interested in co-mentoring.
this sounds like a good and valueable project to me. I'd just like to mention that it would have been nice if you came up with that 2 weeks ago already and added it to the boost gsoc projects page.
uh i just realized that you had actually posted that here about two weeks ago and no one picked up on it, unfortunately... sorry then - you did everything right!
There is some competition to get into GSoC as a mentoring organization and the more project ideas boost provides the more likely it gets supported... However, google is just posting the list of accepted organizations and boost is in, so we are fine on that :)
https://google-melange.appspot.com/gsoc/org/google/gsoc2013/boost
Mario
THK
On Mon, Apr 8, 2013 at 11:32 AM, Daniel Mitchell <
dlm.bulk.messages@gmail.com> wrote:
Hi all, I'm a researcher and graduate student at the University of Texas at Austin and I'm interested in doing a Boost.Graph project for GSoC. I was thinking of doing one or more planar graph algorithms, in particular the multiple source shortest paths algorithm for planar graphs described at
http://courses.csail.mit.edu/6.889/fall11/lectures/L11.html
The algorithm assumes that the sources are located on a single face. It proceeds by calculating the shortest paths tree from one source and then minimally modifying the tree to efficiently get the shortest paths from the other sources. The algorithm uses a dynamic tree data structure, so developing that data structure would be part of the project too.
I've made prior contributions to BGL. I worked with Doug Gregor to implement color maps for the breadth first and Dijkstra's algorithms. One of my current areas of research is movement ecology, where planar graphs can be used to study movement.
Let me know what you think.
Daniel Mitchell
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
On Mon, Apr 8, 2013 at 3:34 PM, Mario Mulansky
uh i just realized that you had actually posted that here about two weeks ago and no one picked up on it, unfortunately... sorry then - you did everything right!
Sorry. I should have sent a followup to Daniel's original. I was under a couple of deadlines. Terrific that Boost made it into SoC again this year. THK -- http://www.keittlab.org/
participants (3)
-
Daniel Mitchell -
Mario Mulansky -
Tim Keitt