Re: construct graph, from edge-weights and few coordinates
- From: itschy <google@xxxxxx>
- Date: Tue, 5 Feb 2008 03:17:29 -0800 (PST)
Hi Tim.
On 5 Feb., 04:35, Tim Little <t...@xxxxxxxxxxxxxxxxxxxxxxxxxx> wrote:
On 2008-02-03, itschy <goo...@xxxxxx> wrote:
Are you talking about a graph mapped onto a plane? At this point it
seems possible that it could also be a 3D problem.
Yes, sorry, I didn't mention it.
The data is from a browser game, where only the distances between all
the cities on a map are known.
So we can assume that all the cities are connected (and its okay to
assume that they all exist in the same plane, no heights have to be
considered).
I can manually find useful coordinates by measuring them on a printed
map where most cities are displayed.
What I mean with "each node is connected with at least three nodes" is
the following:
If there is only one connection, the possible coordinates are on a
circle around the node it is connected to.
With two edges we have one solution and another mirrored at the axis
between the two nodes our node is connected.
With three edges connected to the already constructed graph, we have
only one solution left.
What I seek is an algorithm that works like this. are there any?
.
- Follow-Ups:
- Re: construct graph, from edge-weights and few coordinates
- From: Tim Little
- Re: construct graph, from edge-weights and few coordinates
- References:
- construct graph, from edge-weights and few coordinates
- From: itschy
- Re: construct graph, from edge-weights and few coordinates
- From: Tim Little
- construct graph, from edge-weights and few coordinates
- Prev by Date: Re: Simplification of information - how to do it efficiently?
- Next by Date: Re: Test
- Previous by thread: Re: construct graph, from edge-weights and few coordinates
- Next by thread: Re: construct graph, from edge-weights and few coordinates
- Index(es):
Relevant Pages
|