Hi Jake, If the curve is known analytically, it is an elementary minimization exercise of calculus. If your curve is just a bunch of points, then you do it numerically in JavaScript. The time depends on the number of points and the accuracy depends on the density of the points. There is no better way to estimate the time, but just by experimenting. Cheers, Samy
--- In [email protected], "Jake Beard" <[EMAIL PROTECTED]> wrote: > > I have what I think must be a fairly common requirement: I need an efficient > method for calculating the minimum distance from a point to a curve. It > would be possible to solve this problem numerically in JavaScript, but I'm > not confident that JavaScript would be efficient enough, and I'm wondering > if there isn't something built into the SVG spec that might be leveraged to > help with this. > > I'd appreciate any guidance anyone can offer. Thanks, > > Jake > > > [Non-text portions of this message have been removed] > ------------------------------------ ----- To unsubscribe send a message to: [EMAIL PROTECTED] -or- visit http://groups.yahoo.com/group/svg-developers and click "edit my membership" ----Yahoo! Groups Links <*> To visit your group on the web, go to: http://groups.yahoo.com/group/svg-developers/ <*> Your email settings: Individual Email | Traditional <*> To change settings online go to: http://groups.yahoo.com/group/svg-developers/join (Yahoo! ID required) <*> To change settings via email: mailto:[EMAIL PROTECTED] mailto:[EMAIL PROTECTED] <*> To unsubscribe from this group, send an email to: [EMAIL PROTECTED] <*> Your use of Yahoo! Groups is subject to: http://docs.yahoo.com/info/terms/
