Hi Matseevsky,
You convinced me. My proposition was to simplistic. I've tried to add
more requirements for the curve, but found always a loophole.
If I'll find something else, I'll write you. Cheers, Samy
--- In svg-developers@yahoogroups.com, a_matseevsky
[EMAIL PROTECTED] wrote:
--- In
Hi!
I am not kidding. Your example is what I meant by inflection points.
I forgot to add that the curve should be continuous.
Cheers, Samy
--- In svg-developers@yahoogroups.com, a_matseevsky
[EMAIL PROTECTED] wrote:
--- In svg-developers@yahoogroups.com, Samuel Dagan dagan@
wrote:
Hi
--- In svg-developers@yahoogroups.com, Samuel Dagan [EMAIL PROTECTED]
wrote:
Hi!
I am not kidding. Your example is what I meant by inflection
points.
I forgot to add that the curve should be continuous.
Cheers, Samy
Are you kidding? Let's try to imagine 5 points- P1, P2, P3, P4
and
--- In svg-developers@yahoogroups.com, Samuel Dagan [EMAIL PROTECTED]
wrote:
Hi Jake,
I've just started to calculate the case of Bezier2, in order to
obtain
the algorithm. I am glad that you found the solution. This also
saved
me from the calculation.
If a curve is defined by a bunch of
: Jake Beard
To: svg-developers@yahoogroups.com svg-developers%40yahoogroups.com
Sent: Thursday, September 11, 2008 3:55 PM
Subject: Re: [svg-developers] Re: efficient method for calculating min
distance from point to curve
Samy,
Thank you for the quick response. I am not very familiar
in the community
web site?
- Original Message -
From: Jake Beard
To: svg-developers@yahoogroups.com svg-developers%40yahoogroups.com
Sent: Thursday, September 11, 2008 3:55 PM
Subject: Re: [svg-developers] Re: efficient method for calculating min
distance from point to curve
Samy,
Thank you
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
Samy,
Thank you for the quick response. I am not very familiar with the
mathematics of bezier curves. Is there a deterministic way of converting
converting an SVG path from its representation in XML markup to an analytic
representation, so that the calculus minimization may be applied?
Thanks
like something to put in the community web
site?
- Original Message -
From: Jake Beard
To: svg-developers@yahoogroups.com
Sent: Thursday, September 11, 2008 3:55 PM
Subject: Re: [svg-developers] Re: efficient method for calculating min
distance from point to curve
Samy
9 matches
Mail list logo
