This year, I decided to enter the ACM SIGSPATIAL GIS Cup challenge. The topic was very interesting: Find the shortest path in a street network given a set of dynamic, polygonal constraints. Furthermore, the challenge was very appealing as it started to be based on OpenStreetMap data without much post-processing, so algorithms and demonstrations would be applicable to the whole world map (or sensible sections of the world map).

I am very happy to announce that my contribution to the challenge was accepted and rated as the best contributions this year. Consequently, I was invited to submit a paper describing the challenge and created a poster to show off some interesting stuff behind it.

As a first look on the project, check out my youtube video at

Downloads / Further information