http://en.wikipedia.org/wiki/Happy_Ending_problem#Empty_polygons
On Mon, Apr 19, 2010 at 5:09 AM, [email protected] <[email protected]> wrote: > I am trying to solve the following problem: > > "Given a set of (x,y)-points P find a subset P' of P such that the > convex hole of P', CH(P') contains all points of P' as it's vertices > and no point of P\P' is contained inside the convex hole. Find such a > set P' so that CH(P') has the maximal possible area" > > I have no clue on how to attack this problem so any hint is > appreciated. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
