algorithm - how do you calculate co-ordinates of point based on constraints relative to other points? -


I know this is mathovflow content, and I'll take my way out there. I'm hoping someone will recognize it and tell me in the right direction ...

I am trying to map the related nodes. I have come to know how to calculate the minimum distance between all the points, and now I should know how to change them in real coordination in 2D space.

Then, a point P N (where n> 1), a set of digits [P 1 .. p N-1 ], and a set of distance [d 1 .. d n-1 ] where each dp n and related point Represents the minimum distance between, how can I calculate the best valid p n set to [x, y]?

When I say the 'best' valid coordination set, I mean set p n

my first thoughts [0,0] at p 1 < / Sub> was to be left, at [0, D] (D 1 p 2 ) and then

<3 for this I [0, y] where y is the minimum distance, which is <3> to its D 1 and d 2 To satisfy and then move it around <2> 2 in the circle of a circle, in the form of 2 By the time it still satisfies d 1 .

It will be repeated for all the points, which seem like it will take ages. / P>

Does this problem ring anybody with someone? I'm not sure which formula or algorithm I am seeing.

Update I did not think what 'closest' means. I knew that when I wrote it, then what I said, but I did not think of calculating it!

The minimum age of the affair looks like it will work.

It seems as if you are trying to do some form


Comments

Popular posts from this blog

sql - dynamically varied number of conditions in the 'where' statement using LINQ -

asp.net mvc - Dynamically Generated Ajax.BeginForm -

Debug on symbian -