Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.



Re: smallest enclosing polygon
Posted:
Apr 21, 2006 9:09 AM


Are the points to be contained in the perimeter of the polygon, or are some of the points in the interior? Is a half moon not a semicircle, which is convex?
At 03:23 PM 4/20/06, you wrote:
>The problem now is  what do you mean by smallest? >Is it smallest area (but perhaps longest perimeter? > >I think you might end up with a ragged 'star shaped' polygon which >is 'smallest in area'. >In fact, smallest in area might have area zero (just a path, covered twice). > >I am not sure the question is well posed yet! > >walter > >On 20Apr06, at 3:34 PM, Steffen Koehler wrote: > >Hello, > >I have a set of 2d points. I search an algorithm that creates an >polygon which contains all points. The simplest way is the >construction of an convex hull. But when I have an set looks like an >half moon, I need an polygon which looks like the half moon contour. > >thanks in advance >Steffen > > > > > > >No virus found in this incoming message. >Checked by AVG AntiVirus. >Version: 7.1.385 / Virus Database: 268.4.4/320  Release Date: 4/20/06
  No virus found in this outgoing message. Checked by AVG AntiVirus. Version: 7.1.385 / Virus Database: 268.4.4/320  Release Date: 4/20/06
 End of Forwarded Message



