Check out the B-Spline algorithm for this. It is a generatlization of the Beizer curve to n points.
Mathworld has a definition, but searching with Google should bring up a ton of references on the subject. It is a very fast algorithm. http://mathworld.wolfram.com/B-Spline.html Alan -----Original Message----- From: Shekhar, Jayant [mailto:[EMAIL PROTECTED]] Sent: Wednesday, March 13, 2002 6:30 PM To: [EMAIL PROTECTED] Subject: [JAVA2D] Joining points by a curve I am looking for an algorithm to join a set of (x,y) points by a curve. The faster the execution the better. There are no further constraints. I have tried looking for it in quite a few places but still haven't found it. Thanks!!! Jayant Shekhar. =========================================================================== To unsubscribe, send email to [EMAIL PROTECTED] and include in the body of the message "signoff JAVA2D-INTEREST". For general help, send email to [EMAIL PROTECTED] and include in the body of the message "help". ==========================================================================To unsubscribe, send email to [EMAIL PROTECTED] and include in the body of the message "signoff JAVA2D-INTEREST". For general help, send email to [EMAIL PROTECTED] and include in the body of the message "help".
