From: <HIDDEN>
Newsgroups: comp.soft-sys.matlab
Subject: Re: Triangulation using sphere intersects
Date: Wed, 28 Jan 2009 02:55:04 +0000 (UTC)
Organization: The MathWorks, Inc.
Lines: 20
Message-ID: <glohe8$ai1$>
References: <gg5tb3$ms3$> <gg7ep2$dg$> <gg7ibf$iq3$> <glmpbp$cte$> <glmqdh$m8h$> <glmsf6$7b6$>
Reply-To: <HIDDEN>
Content-Type: text/plain; charset="ISO-8859-1"
Content-Transfer-Encoding: 8bit
X-Trace: 1233111304 10817 (28 Jan 2009 02:55:04 GMT)
NNTP-Posting-Date: Wed, 28 Jan 2009 02:55:04 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 1187260
Xref: comp.soft-sys.matlab:514390

"gregoire " <> wrote in message <glmsf6$7b6$>...
> Thanks David for your response, some interesting reads there, especially as I may have to look into errors and noise variation in my data at a later stage.
> I dont wish to find a new method (though the Newton-Rapshon one seems interesting) for now Im just trying to work out how to 
> a) use plot3 to plot many circles together in 3d space, which are of the form:-
>  Q = P + R*u*cos(s) + R*v*sin(s)
> where s is an (angular) parameter and Q an arbitrary point on the circle. u,v are necessary orthogonal vectors, 
> as that is the way I have already coded and successfully calculated the necessary parts, from my data
> and b) attempting to find potential intersections betweens these circles 
> Thanks again

  I don't think I agree with you, Gregoire, that finding the intersections of the parametric circles is the best way to find the intersection points of triplets of spheres.  The way I outlined to you involving three intersecting planes and then a certain distance in either direction along a line orthogonal to the plane of the three centers is a far better method which does not involve iterative methods like Newton-Raphson.  You get the two points all in one clean shot without convergence worries or iterations.  The fact that the circles will run through these points does not help you in my opinion.  I think you will find that things are easier that way.

Roger Stafford