@Pure
	public static double distanceSquaredLinePoint(
			double sx1, double sy1, double sz1, double sx2, double sy2, double sz2,
			double px, double py, double pz) {
		double d = distanceLinePoint(sx1, sy1, sz1, sx2, sy2, sz2, px, py, pz);
		return d * d;
	}
@ Pure public static double distanceSquaredLinePoint ( double sx1 , double sy1 , double sz1 , double sx2 , double sy2 , double sz2 , double px , double py , double pz ) { double d = distanceLinePoint ( sx1 , sy1 , sz1 , sx2 , sy2 , sz2 , px , py , pz ) ; return d * d ; }
Compute and replies the perpendicular distance from a point to a line.
<p>
Call the point in space <code>(i,j,k)</code> and let <code>(a,b,c)</code>
and <code>(x,y,z)</code> be two points on the line (call it line A).
The crucial fact we'll use is that the minimum distance between the point
and the line is the perpendicular distance. So we're looking for a point
<code>(L,M,N)</code> which is on A, and such that the line connecting
<code>(L,M,N)</code> and <code>(i,j,k)</code> is perpendicular to A.

@param sx1
is the X coord of the first point of the line
@param sy1
is the Y coord of the first point of the line
@param sz1
is the Z coord of the first point of the line
@param sx2
is the X coord of the second point of the line
@param sy2
is the Y coord of the second point of the line
@param sz2
is the Z coord of the second point of the line
@param px
is the X coord of the point
@param py
is the Y coord of the point
@param pz
is the Z coord of the point
@return the distance