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:

1) Minimum Distance Point to Segment

2) USC Spring 2013 ACM Walking on Thin Ice

Solution Stats

20.81% Correct | 79.19% Incorrect
Last Solution submitted on Mar 19, 2024

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers24

Suggested Problems

More from this Author296

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!