0) ignore stuff like "infinitely quick" since that isn't realistic for what we are doing :-)
1) For the map I am displaying, pick a handful of points of interest to hse as controls, as well as my current location.
2) Use existing data we already have for stuff like direction routing to get travel times between all the pairs in our points of interest.
3) Draw a weighted graph, where each vertex is one of our points of interest and each edge is weighted by travel time. The initial position of each point should be it's geographic position, but we can then use an existing graph layout algorithm that uses an energy-based method (e.g. pretend the edges are springs) to deform the graph. This way each point will end up with its distance being proportional to travel time.
4) Using initial points as our input control points, and their location in the graph as output cobtrol points, use any number of image warping algorithms put there to calculate our warp / morph / deformation field.
5) Apply to initial map image.
I don't know how well it would work in practice but seems like a reasonable first stab at it! :-)
EDIT: Apologies for typo, fat fingers on mobile!
My gut says it's probably more realistic to do this for large scale maps (say between major cities, 100s of miles, where distance is pretty proportional to travel time). Once you get down to the city / street level, yeah it probably gets real dicey with high variation in travel speeds depending on the particular road and how routes are laid out, and you just aren't going to get pretty triangles fitting together nicely :-P.
In any case its a fun problem to think about!
An infinitely quick circle would reduce to a point. Morphing a 2D map in 3D, I would imagine the inside of the circle like a balloon with the circle as the opening. Reducing that to 2D seems impossible without breaking it somehow.
I guess the problem is worth at least a paper, if not a dissertation. Maybe there is some esoteric math paper in topology which already solved that? Or has proven it impossible?
I would love an HN/GoFundMe or Patreon mashup, where people could take on cool hacks in a thread that readers are willing to support.
I have zero free time at this point in my life, but would be willing to throw some money at folks who do have free time and skills.
On a modern GPU, it's basically just as efficient as in pixel shaders, with two caveats:
1. If you want mip-mapping, you have to do LOD calculations yourself, which is likely a bit slower. (Not an issue in what you have in mind.)
2. There are questions around the locality of your memory accesses. As long as you lay out your vertices more or less along a space-filling curve (which is a good idea for grids anyway, due to vertex reuse) you should be mostly fine. Obviously the details will vary depending on the exact architecture.