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:
I find it amusing that an answer that games the problem still has a larger Cody size than the leading solution...
It is my way to learn something about Matlab: seeing other player's solutions. So If I cannot solve the problem (and obviously see other solutions) I use if/else.
Impressive Cell array processing, complex usage, arrayfun, and function vectorization.
5377 Solvers
5163 Solvers
Swap the first and last columns
9238 Solvers
Return the 3n+1 sequence for n
4951 Solvers
1519 Solvers
Solution 1131881
The test suits only examines polycell = {[0 0 5 10 10 0] [5 -1 6 -5 5 -5]}, Can anyone help please