The implementation to find the closest point on the routing graph needs to be quick as currently but should also find the correct point. See also PR #161.
