Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I've been trying to find the distance $d$ in this system where I only can know the distances $a0, a1, b0, b1, c0, c1$ but not the position of $A, B, C, P0, P1$. I tried 2D trilateration using nonlinear least squares method but I'm not being able to solve it.

enter image description here

Is it possible to solve it? If it is, how can I do that?

Thanks in advance!

share|cite|improve this question
up vote 1 down vote accepted

It seems to me that the only restriction you have is that the distance $d$ you are looking for has to be the third side of triangles with sides $a_0,a_1,d$; $b_0,b_1,d$; $c_0,c_1,d$.

But these constraints mean that $|a_0-a_1|\leq d\leq a_0+a_1$ and equivalent for $b$ and $c$. So you can only restrict $d$ to an interval, and with $d$ in that interval, you will be able to construct triangles (possibly degenerate) on a base of length $d$ which satisfy the constraints.

share|cite|improve this answer
I see your point, thanks! I cant upvote you because I don't have enough reputation. – uDalillu Sep 2 '12 at 20:59

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.