this is my first post on the mathematics node of stack exchange, so please forgive me if I'm not posting an appropriate question, but I'm not sure where else to address this. I'm trying to figure out ...
I have question related to circle-packing. The problem is to find the circle of minimum radius enclosing four non-overlapping circles of arbitrary radius. I have to write a program in C for this ...
Is there an easy way to find the 4th point given 3 fixed points and a different minimum length between the 4th point and each of the 3 points? Similar to this question, but with non-fixed minimum ...
I need to find location of the point $s_0$; the locations of other three points ($s_1$, $s_2$, $s_3$) are known. $d_i$ are known distances. Given: $x_1$, $x_2$, $x_3$, $y_1$, $y_2$, $y_3$, $d_1$, ...
Let's assume, hidden in a forest, there's a beacon. I walk in the forest and, at random intervals, ping the beacon. For each ping I get a lat/lng pair and the signal strength of the ping at that point ...
I'm trying to work out how to write an algorithm to randomly place circles of $R$ radius, in a 2d rectangle of arbitrary dimensions, such that each placed circle is at least $D$ distance away from ...