THE POST BELOW IS MORE THAN 5 YEARS OLD. RELATED SUPPORT INFORMATION MIGHT BE OUTDATED OR DEPRECATED
On 15/05/2006 at 03:10, xxxxxxxx wrote:
Cinema 4D Version: 9
Platform: Windows ;
Language(s) : C++ ;
I'm kind of stuck here. I've got 2 Splines here, and want to calculate where they intersect.
Ok, i know, intersection is very unlikely in 3D space but then i want to have the point with the least distance to both of the splines.
Is there a possibility to calculate this in a fast way? till now i subdivide both of them by 100 and calculate the distance of the points... but thats not accurate and very slow
would be nice to hear of your ideas
On 18/05/2006 at 07:09, xxxxxxxx wrote:
no one got an idea?
it's quite hard to do
On 18/05/2006 at 09:44, xxxxxxxx wrote:
There are ways to do it and approximations. Would using the linear representation of the spline be sufficient? If so you can just use a line to line closest point, but however you find the closest points you will still need to use a method to speed it up. Not everyone may want to share how they do that since there are many ways, often you simply write your own depending on your data and needs. Essentially you just need a way to reduce the tests by using larger tests first, such as simply splitting the space into a grid and then you can easily reject areas of the spline that can not intersect. This isn't really a CINEMA SDK question, you may get more luck in a general graphics or programming forum.