Timeline for Minimum distance between two arbitrary circles in space?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 12, 2012 at 23:35 | comment | added | Robert Israel | Actually it's not quite so bad as degree $20$, because $(1+s^2)^4$ or $(1+t^2)^4$ is a factor. | |
| Apr 12, 2012 at 19:48 | comment | added | Gerhard Paseman | If you are, it is a modification of this MathOverflow posting mathoverflow.net/questions/24184 . If one has to pack two circles the problem is easily resolved. My version is more challenging because I take a chord of distance 1/2 radius from the center of the large circle, chop off the smaller piece, and try to pack the two circles into the larger piece. It is easily achievable for most pairs of circles, but I can't prove it for all appropriate pairs. Gerhard "Willing To Retask Comment Fields" Paseman, 2012.04.12 | |
| Apr 12, 2012 at 19:36 | comment | added | Gerhard Paseman | Degree 20? Wow. Are you willing to tackle a packing problem which might result only in a polynomial of degree 8? Gerhard "Ask Me About System Design" Paseman, 2012.04.12 | |
| Apr 12, 2012 at 19:32 | history | answered | Robert Israel | CC BY-SA 3.0 |