Crates.io | distance_difference_triangulation |
lib.rs | distance_difference_triangulation |
version | 0.3.2 |
source | src |
created_at | 2024-04-06 10:37:33.751164 |
updated_at | 2024-04-08 11:30:21.007319 |
description | Position triangulation from differences of distances |
homepage | https://github.com/Garbaz/distance_difference_triangulation |
repository | https://github.com/Garbaz/distance_difference_triangulation |
max_upload_size | |
id | 1198229 |
size | 38,729 |
‖ Docs.rs ‖ Lib.rs ‖ Crates.io ‖
This crate consists of exactly one function: [distance_difference_triangulation
].
The premise is as follows: You are at some unknown position in 2D space. There are three beacons. You do not know the distances to these three beacons, otherwise you could just do normal triangulation and be done with it. But you do know the differences between the distances to these beacons. You also know the distances between the beacons themselves. From this information, the function this crate provides computes your position, relative to the coordinate system defined by the beacons.
In mathematical terms:
Your unknown position is (x,y)
.
The unknown distances to the three beacons are d0
, d1
and d2
.
You do know dd01 = d0 - d1
and dd02 = d0 - d2
(and also dd12 = d1 - d2
, but that's redundant).
You also know the distances between the beacons d01
, d02
and d12
.
The function of this crate computes for you your position in the coordinate
system where beacon 0 is at (0,0)
and beacon 1 is on the x axis.
See also triangulation_from_dist_diff.