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
Solution Comments
Show commentsProblem Recent Solvers62
Suggested Problems
-
Given two arrays, find the maximum overlap
1723 Solvers
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1305 Solvers
-
Similar Triangles - find the height of the tree
469 Solvers
-
17692 Solvers
-
Check that number is whole number
5203 Solvers
More from this Author308
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?