I successfully used the java code for routing computation, i.e. given two points the GraphHopper engine computes alternative routes making available a list of key points. Anyway I currently have a specific need: a list of equally-spaced points covering all the proposed route.
One way in order to reach this goal is to fill the gap between two points with the necessary points along the straight segment between them. Anyway this solution fails when the two point are far etch-other and positioned on a curved line because the filler points will not match the street.
Can you kindely suggest me a way to reach my goal? I was exploring the map-matching module but I’m not sure the it will finally provide what I need and I’m afraid that there exist a simple way I currently can’t see.