This Challenge is to determine the minimum distance from a 2-D line segment defined by two points to a point.
The point is (px,py) and the segment is [(vx,vy) to (wx,wy)].
Input are the three defining points and the output is distance.
Input (px py vx vy wx wy): 1 1 0 3 3 0
Output distance: .7071
Point is beyond perpendicular to segment.
Input (px py vx vy wx wy): 4 3 -100 0 0 0
Output distance: 5
Follow Up Challenges: