|
![](/i/fill.gif) |
"Edward Coffey" <eco### [at] alphalink com au> wrote in message
news:3E8### [at] alphalink com au...
> Yes, but as I stated in my original post, the mathematics of this is
> quite complex, it's not as though you're finding the minimum of a
Does the solution need to be proper math, and does the result have to be
perfect?
For a kludge, IMHO it shouldn't be too hard to write a macro that will return
the two points using a brute force approach. i.e. (approx. code, won't parse)
#declare Len = 10000000000000
#declare R1 = 0
#while (R1 < 360)
#declare R2 = 0
#while(R2 < 360)
#if(distance between R1 on 1st circle and R2 on 2nd circle < Len)
Len = that distance
#end
#declare R2 = R2 +1
#end
#declare R1 = R1 + 1
#end
Post a reply to this message
|
![](/i/fill.gif) |