|
![](/i/fill.gif) |
On Wed, 26 Mar 2003 01:32:53 +1100, Edward Coffey <eco### [at] alphalink com au>
wrote:
> Yes, but as I stated in my original post, the mathematics of this is
> quite complex
I would go for approximation. If it has to be calculated once you probably can
use approximation as Tom Melly suggested. Otherwise I think there is possible
fast approximation using functions. Consider your circles as toruses with minor
radius = 0. Then construct two functions which represent your circles
#declare torus1=function(x,y,z){...}
#declare torus2=function(x,y,z){...}
using transformations and shapes available in IsoCSG library. Then define space:
#declare space=function(x,y,z){torus1(x,y,z)*torus2(x,y,z)};
I imagine the edge with nearest distance has probably lowest possible values
larger than 0. IIRC there are some analyze methods for finding that path but I
can't recall exact names.
ABX
Post a reply to this message
|
![](/i/fill.gif) |