Hello,
I have a practical problem which I can't solve (anymore). High-school and university (where I had some advanced math) is too long ago and I haven't kept up since...
- There are 2 beacons (1) and (2).
- The distance between (1) and (2) is known.
- These 2 beacons 'create' 2 'virtual' beacons (A) and (B), each at the intersections at distance x from both beacon (1) and (2).
- There are several candidates to become beacon number (3).
- For each of these candidates the distance to the existing beacon (1) and (2) is known.
- The ‘system’ doesn’t know coordinates.
- To determine which candidate gets priority, there are some rules related to the distance between the candidate and beacon (A) and (B).
- HOW can the distance to beacon (A) and (B) be calculated (easily) or HOW can this be (easily) approximated?
- The calculation should be simple/easy as the calculation should be performed realtime/online: at the moment a candidate shows up, it should get feed back about its priority ranking within a few seconds.