Re: Algorithm for distance from point to function
- From: "Terry" <tbwright@xxxxxxxxx>
- Date: 15 Jul 2006 17:13:58 -0700
The minimum distance is the length of the shortest line from the point
x1y1 to a tangent to the line y=f(x). The equation of the tangent is a
line whose slope is the first derivative at x2y2. The point x2,y2
satisfying the function and at the shortest distance is the
intersection of a line through x1y1 which is perpendicular to the
tangent at x2,y2 and therefore has a slope of the inverse of the tanget
(or the reciprocal of the first derivative at that point).
Then the distance is just the normal Gausian square rooot of the sum of
the squares of the differences between each coordinate of the pair
x1,y1; x2,y2
Searching by closer approximations is the best technique.
.
- Follow-Ups:
- Re: Algorithm for distance from point to function
- From: Mike . Prager
- Re: Algorithm for distance from point to function
- References:
- Algorithm for distance from point to function
- From: Mike . Prager
- Re: Algorithm for distance from point to function
- From: Thomas Koenig
- Re: Algorithm for distance from point to function
- From: glen herrmannsfeldt
- Algorithm for distance from point to function
- Prev by Date: Re: FORTRAN grid plotting on a map.
- Next by Date: Re: Algorithm for distance from point to function
- Previous by thread: Re: Algorithm for distance from point to function
- Next by thread: Re: Algorithm for distance from point to function
- Index(es):
Relevant Pages
|