turk@Apple.COM (Ken "Turk" Turkowski) (02/01/91)
In article <1991Jan9.182926.16492@silma.com> reddy@.UUCP () writes: > I am looking for an efficient algorithm to find intersection of a line > (2D) and >a parametric curve (2D). I want intersecting point and the > parameter value (t) at this >point. Speed is the criteria here. > > >Pointer to any references is appreciated. > >Thanks in advance > > > Ravindar Reddy - e_mail - reddy@silma.com Convert the curve to Bezier and use subdivision to zero in. You can use Sederberg's focus method to increase the convergence rate. -- Ken Turkowski @ Apple Computer, Inc., Cupertino, CA Internet: turk@apple.com Applelink: TURK UUCP: sun!apple!turk