[Routing] Articles about CH

[Alexander Chernetsky]

Hi,

Currently I am working on understanding and implementation of CH algorithm.
So far I am using static graph information and iterative node contraction
(node by node). I do not have a good overview of literature on this topic
out there. OSRM is—obviously—far superior comparing to my implementation,
in terms of speed and memory requirements. Usually most good tricks and
tips, improving performance, are scattered throughout many articles. In
addition I am trying to incorporate turn costs and modeling turn
restriction in CH.

Could you please kindly point me to articles, data structures, whatever you
consider would be helpful, so that after reading—I hope—I will be able to
speed up my implementation? Currently I am stuck. It’s able to find a route
in 10ms with Poland and Belarus maps.

Thanks in advance!
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.openstreetmap.org/pipermail/routing/attachments/20141121/9a600b56/attachment.html>