R help - May 2004 - Applications of the Distance from a Point to a Curve

I would like to know if anyone knows about (real) situations where it is 
necessary to compute the euclidean distance from a point to a curve (or even 
the point where it is reached), you may not assume that the point is very 
close to the curve (unlike the usual fitting problems).
I have special interest in applications to phisics.

Thanks in advance,

Dimas

With maps in R, it can sometimes be desirable to compute the 
minimum distance between two polygons and / or find any intersections 
between two lines and / or polygons. 

      Some clustering algorithms use the minimum distance between a 
given point and all points in a cluster. 

      Are examples like this relevant to your question? 

      spencer graves

Dimas Martnez Morera wrote:
>I would like to know if anyone knows about (real) situations where it is 
>necessary to compute the euclidean distance from a point to a curve (or even
>the point where it is reached), you may not assume that the point is very 
>close to the curve (unlike the usual fitting problems).
>I have special interest in applications to phisics.
>
>Thanks in advance,
>
>Dimas
>
>______________________________________________
>R-help at stat.math.ethz.ch mailing list
>https://www.stat.math.ethz.ch/mailman/listinfo/r-help
>PLEASE do read the posting guide!
http://www.R-project.org/posting-guide.html
>  
>