A set of $n$ points in $\mathbb{R}^2$ is algebraically independent over $\mathbb{Q}$ if there is no polynomial dependency among the $2n$ coordinates.
A result (Lemma 3.3) from "Globally linked pairs of vertices in equivalent realisations of graphs" by Jackson, Jordan and Szabadka, shows that, modulo a minor detail about isometries, algebraic independence of a set of $n$ points is equivalent to algebraic independence of a set* of $2n-3$ Euclidean distances between those points.
*clearly you can't choose any such set, but there is a quite natural condition you must satisfy.
I am wondering if it is possible to say something similar for sets of points in a real 2-dimensional normed space? If it makes things easier, I think the case of $\mathbb{R}^2$ equipped with an $l_p$ norm, $p\neq 2$, (probably you want to exclude the $1$ and $\infty$ norms), would be interesting.
Is there any literature where algebraic independence/transcendence degree is considered in a set up with a non-Euclidean norm/metric?