<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: A Cody problem: simplify a polygon</title>
	<atom:link href="http://blogs.mathworks.com/steve/2012/07/09/a-cody-problem-simplify-a-polygon/feed/" rel="self" type="application/rss+xml" />
	<link>http://blogs.mathworks.com/steve/2012/07/09/a-cody-problem-simplify-a-polygon/</link>
	<description>Steve Eddins manages the Image &#38; Geospatial development team at The MathWorks and coauthored Digital Image Processing Using MATLAB. He writes here about image processing concepts, algorithm implementations, and MATLAB.</description>
	<lastBuildDate>Mon, 20 May 2013 12:58:04 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.5.1</generator>
	<item>
		<title>By: Anton</title>
		<link>http://blogs.mathworks.com/steve/2012/07/09/a-cody-problem-simplify-a-polygon/#comment-24891</link>
		<dc:creator>Anton</dc:creator>
		<pubDate>Tue, 10 Jul 2012 17:48:57 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/?p=639#comment-24891</guid>
		<description><![CDATA[I have posted a function on FEX a while ago that solves precisely this kind of problem. You can find it here:

http://www.mathworks.com/matlabcentral/fileexchange/34639-decimate-polygon]]></description>
		<content:encoded><![CDATA[<p>I have posted a function on FEX a while ago that solves precisely this kind of problem. You can find it here:</p>
<p><a href="http://www.mathworks.com/matlabcentral/fileexchange/34639-decimate-polygon" rel="nofollow">http://www.mathworks.com/matlabcentral/fileexchange/34639-decimate-polygon</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve Eddins</title>
		<link>http://blogs.mathworks.com/steve/2012/07/09/a-cody-problem-simplify-a-polygon/#comment-24890</link>
		<dc:creator>Steve Eddins</dc:creator>
		<pubDate>Tue, 10 Jul 2012 04:45:11 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/?p=639#comment-24890</guid>
		<description><![CDATA[Sven, Richard&#8212;Thanks. I have updated test case #7, and the solutions are being rescored.]]></description>
		<content:encoded><![CDATA[<p>Sven, Richard&mdash;Thanks. I have updated test case #7, and the solutions are being rescored.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Richard Brown</title>
		<link>http://blogs.mathworks.com/steve/2012/07/09/a-cody-problem-simplify-a-polygon/#comment-24889</link>
		<dc:creator>Richard Brown</dc:creator>
		<pubDate>Tue, 10 Jul 2012 04:17:07 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/?p=639#comment-24889</guid>
		<description><![CDATA[Hi Steve, there&#039;s a problem in your test suite - problem 7 has a starting vertex that can be deleted, but that isn&#039;t in your solution

i.e. P looks like this:


P = [1 2;
     1 1; 

    \vdots

     1 4;
     1 3;
     1 2 ];

The vertex [1 2] should be removed, but isn&#039;t in your solution ...]]></description>
		<content:encoded><![CDATA[<p>Hi Steve, there&#8217;s a problem in your test suite &#8211; problem 7 has a starting vertex that can be deleted, but that isn&#8217;t in your solution</p>
<p>i.e. P looks like this:</p>
<p>P = [1 2;<br />
     1 1; </p>
<p>    \vdots</p>
<p>     1 4;<br />
     1 3;<br />
     1 2 ];</p>
<p>The vertex [1 2] should be removed, but isn&#8217;t in your solution &#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Sven</title>
		<link>http://blogs.mathworks.com/steve/2012/07/09/a-cody-problem-simplify-a-polygon/#comment-24888</link>
		<dc:creator>Sven</dc:creator>
		<pubDate>Tue, 10 Jul 2012 01:50:21 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/?p=639#comment-24888</guid>
		<description><![CDATA[Hi Steve, nice little problem :)

Are you sure the test set at the moment is correct?

I&#039;ve got a solution that fails only on the &quot;Two rectangles separated by line segment&quot; test. This test has:

P = [ ...
    1 2
    1 1
    2 1
{snip}
    1 4
    1 3
    1 2];

According to the criteria to &quot;remove as many vertices as possible from P&quot;, I think that the progression from [1 4] to [1 3] to [1 2] to [1 1] can be reduced to just [1 4] to [1 1]. However, you&#039;ve kept [1 2] in the &quot;correct&quot; output... *scratches head quizically*]]></description>
		<content:encoded><![CDATA[<p>Hi Steve, nice little problem :)</p>
<p>Are you sure the test set at the moment is correct?</p>
<p>I&#8217;ve got a solution that fails only on the &#8220;Two rectangles separated by line segment&#8221; test. This test has:</p>
<p>P = [ ...<br />
    1 2<br />
    1 1<br />
    2 1<br />
{snip}<br />
    1 4<br />
    1 3<br />
    1 2];</p>
<p>According to the criteria to &#8220;remove as many vertices as possible from P&#8221;, I think that the progression from [1 4] to [1 3] to [1 2] to [1 1] can be reduced to just [1 4] to [1 1]. However, you&#8217;ve kept [1 2] in the &#8220;correct&#8221; output&#8230; *scratches head quizically*</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve Eddins</title>
		<link>http://blogs.mathworks.com/steve/2012/07/09/a-cody-problem-simplify-a-polygon/#comment-24887</link>
		<dc:creator>Steve Eddins</dc:creator>
		<pubDate>Tue, 10 Jul 2012 01:16:22 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/?p=639#comment-24887</guid>
		<description><![CDATA[Cris&#8212;Thanks for pointing out a flaw in my test suite. I added a new test case and re-scored all the entries.]]></description>
		<content:encoded><![CDATA[<p>Cris&mdash;Thanks for pointing out a flaw in my test suite. I added a new test case and re-scored all the entries.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Cris Luengo</title>
		<link>http://blogs.mathworks.com/steve/2012/07/09/a-cody-problem-simplify-a-polygon/#comment-24886</link>
		<dc:creator>Cris Luengo</dc:creator>
		<pubDate>Mon, 09 Jul 2012 21:39:34 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/?p=639#comment-24886</guid>
		<description><![CDATA[The problem with my solution, even though it passes the tests, is that the first point (and last, which are assumed to be equal) will never be deleted. If this point is in the middle of a straight line, the solution will be wrong. Fixing this somewhat complicates the code.]]></description>
		<content:encoded><![CDATA[<p>The problem with my solution, even though it passes the tests, is that the first point (and last, which are assumed to be equal) will never be deleted. If this point is in the middle of a straight line, the solution will be wrong. Fixing this somewhat complicates the code.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve Eddins</title>
		<link>http://blogs.mathworks.com/steve/2012/07/09/a-cody-problem-simplify-a-polygon/#comment-24885</link>
		<dc:creator>Steve Eddins</dc:creator>
		<pubDate>Mon, 09 Jul 2012 20:58:23 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.mathworks.com/steve/?p=639#comment-24885</guid>
		<description><![CDATA[UPDATE: In a week or so, I&#039;ll a pick the best solution (according to the well-known purple-seven multiphasic optimality criterion) and send out a prize (a hat or something similar) to the solver.]]></description>
		<content:encoded><![CDATA[<p>UPDATE: In a week or so, I&#8217;ll a pick the best solution (according to the well-known purple-seven multiphasic optimality criterion) and send out a prize (a hat or something similar) to the solver.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
