It can't be trivially reduced, though. Remember you're travelling _through_ a point, with speed, direction, momentum and orientation dependent on the point _before_ that.
So if you have 12 points, there are 10 different 'distances' between the last two. For example, in points A through L, the distance from K to L depends on whether you arrived at K from A, B, C, etc.
The original table would have 11 entries for each point, while the current challenge would require a table of 110 entries for each point.
The complexity increases from (n-1) to (n-1)*(n-2). Not quite squared, but close enough. IMHO that's the opposite of a trivial reduction.