Cody

Problem 1452. Minimum Distance between two N-sided Polygons

Solution 235364

Submitted on 24 Apr 2013 by Marco Castelli
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
polycell={[0 0 5 10 10 0] [5 -1 6 -5 5 -5]}; p2p_min=PolytoPol(polycell); assert(abs(p2p_min-1)<.01);

``` ans = 1 ```

2   Pass
%% polycell={[0 0 0 5 4 5 4 0] [2.5 5.5 3 9 -2 5.6]}; p2p_min=PolytoPol(polycell); assert(abs(p2p_min-0.5)<.01);

``` ans = 0.5000 ```

3   Pass
%% polycell={[0 10 0 90 50 50 100 90 100 10] [0 110 100 110 50 70]}; p2p_min=PolytoPol(polycell); assert(abs(p2p_min-15.617376)<.01);

``` ans = 15.6174 ```

4   Pass
%% polycell={[0 110 100 110 50 70] [20 5 50 7 30 5]}; p2p_min=PolytoPol(polycell); assert(abs(p2p_min-63)<.01);

``` ans = 63 ```

5   Pass
%% polycell={[-5 -5 -4 -4 -3 -3 -2 -2 5 5 5 0] [6 10 6 -10 20 0]}; p2p_min=PolytoPol(polycell); assert(abs(p2p_min-1)<.01);

``` ans = 1 ```