Problem 1452. Minimum Distance between two N-sided Polygons

Created by Richard Zapor

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>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]</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Input:</w:t></w:r><w:r><w:t> polycell={[0 0 0 5 4 5 4 0] [2.5 5.5 3 9 -2 5.6]};</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Output:</w:t></w:r><w:r><w:t> 0.5</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Related Challenges:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>1)</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/cody/problems/1446-minimum-distance-point-to-segment\"><w:r><w:t>Minimum Distance Point to Segment</w:t></w:r></w:hyperlink></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>2)</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/cody/problems/1457-usc-spring-2013-acm-walking-on-thin-ice\"><w:r><w:t>USC Spring 2013 ACM Walking on Thin Ice</w:t></w:r></w:hyperlink></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

61 Solutions
21 Solvers

Last Solution submitted on Jun 01, 2021

Last 200 Solutions

Problem Comments

Solution Comments

Solution 1131881

1 Comment

1 Comment

mohammad z on 1 Mar 2017

The test suits only examines polycell = {[0 0 5 10 10 0] [5 -1 6 -5 5 -5]}, Can anyone help please

Solution 235356

2 Comments

2 Comments

James on 25 Apr 2013

I find it amusing that an answer that games the problem still has a larger Cody size than the leading solution...

Marco Castelli on 26 Apr 2013

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.

Solution 235138

1 Comment

1 Comment

Richard Zapor on 25 Apr 2013

Impressive Cell array processing, complex usage, arrayfun, and function vectorization.

Problem Recent Solvers21

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 1452. Minimum Distance between two N-sided Polygons

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers21

Suggested Problems

More from this Author255

Problem Tags

Community Treasure Hunt

Problem 1452. Minimum Distance between two N-sided Polygons

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers21

Suggested Problems

More from this Author255

Problem Tags

Community Treasure Hunt

Players