Caveat: this may be more of a math problem than a Mathematica-specific problem, but I thought some in this group might have insight.
A solved problem is moving from a map in which there are districts with boundaries to a representation of that map as a network in which the vertices are the districts and edges represent shared boundaries between districts.
fr = UndirectedGraph[
NestGraph[#["BorderingCountries"] &, Entity["Country", "France"],
3]]
But what about the inverse problem: how does one move from a network to a map which is consistent with that network. There are likely to be an infinite number of such maps, but how does one even find a single exemplar. I'm thinking this is actually quite a difficult problem, but perhaps some people here might have insight on the matter and how such an exercise might be tackled using Mathematica.
