Simplify map matching result to minimum set of "control points"


I’m trying to figure out how to take the result of a map matching request and simplify it to the minimal set of points such that if you made a routing request between each, it would reproduce the map matching result.

Are you aware of anything that might solve this problem? If not then any thoughts on how one might approach this problem by tweaking the map matching algorithm, or with a post-processing step using lower level routing utilities?

Thanks - Mike

I fear the only optimal solution would be to try all sorts of combinations with (junction) points to find out the minimal set. But a simple heuristic could be to remove points via e.g. Douglas Peucker until the route is too different or something like this.