Retsam wrote:
> Edward Coffey wrote:
> 
>>Thanks for the code, that's pretty much the approach I was looking at,
>>but hadn't got around to implementing it yet.
>>
> 
> 
> I said there were probably scenarios that break my code, and I found one.
> Take two circles, where the plane containing points C and D and vector M
> also contains or very nearly contains vector N.  I.e. N ~= M + a*(D-C),
> where a is arbitrary.  The easiest example is if M=N.

Thankfully my circles are very well behaved. They never touch one 
another, never lie in parallel planes and always have exactly one pair 
of closest points.

Post a reply to this message