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 comments
Loading...
Problem Recent Solvers28
Suggested Problems
-
Sort a list of complex numbers based on far they are from the origin.
5823 Solvers
-
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
2157 Solvers
-
196 Solvers
-
6041 Solvers
-
Integer Sequence - II : New Fibonacci
708 Solvers
More from this Author306
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!