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:
Solution Stats
Solution 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.
-
1 Comment
Richard Zapor
on 25 Apr 2013
Impressive Cell array processing, complex usage, arrayfun, and function vectorization.
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)
Solution 1131881
The test suits only examines polycell = {[0 0 5 10 10 0] [5 -1 6 -5 5 -5]}, Can anyone help please