Problem 1452. Minimum Distance between two N-sided Polygons
This Challenge is to determine the minimum distance between two non-overlapping polygons. The input is a cell array of two vectors that represent the sequential points of 3 to 100 sided polygons. [x0 y0 x1 y1 ... xn yn]
Input: polycell={[0 0 0 5 4 5 4 0] [2.5 5.5 3 9 -2 5.6]};
Output: 0.5
Related Challenges:
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers24
Suggested Problems
-
Back to basics 12 - Input Arguments
586 Solvers
-
Convert a numerical matrix into a cell array of strings
1603 Solvers
-
697 Solvers
-
Make a random, non-repeating vector.
8356 Solvers
-
Flip the vector from right to left
8398 Solvers
More from this Author294
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!