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:
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers62
Suggested Problems
-
4494 Solvers
-
Project Euler: Problem 3, Largest prime factor
1790 Solvers
-
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
2043 Solvers
-
440 Solvers
-
Find the index of the largest value in any vector X=[4,3,4,5,9,12,0,4.....5]
399 Solvers
More from this Author309
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Is a numerical approximation allowed, or should one use the geometric formulas?