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

Solve

Solution Stats

152 Solutions

27 Solvers

Last Solution submitted on Feb 16, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers27

George Berken Augusto Mazzei Mehdi Dehghan Hoang Minh Tri

Suggested Problems

More from this Author309

Community Treasure Hunt

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

Start Hunting!