I am trying to solve a network generation problem, and I'd be happy about inputs. First of all, my problem description:
I have a list of connections between locations with respective distances. For example:
LocationA <-> LocationB: 4500 m LocationB <-> LocationC: 3000 m LocationC <-> LocationA: 2000 m ...and so on...
What I do not know, but try to find out: The actual geographic position of my locations. I do know the position of a few nodes in the network, and given a large list of connections with distances, I should be able to approximatively find the positions of my unknown locations.
Note: I am not trying to actually to optimize any paths within this network (e.g. Dijkstra etc.). I simply would like to know what geographic coordinates the nodes in my system have.
My question is: What sort of "node placement algorithm" am I looking for? I'd be happy for any keywords in this regard. I am 100% sure there are some algorithms for this problem, but I do not even know what to search for.