How to find the most complex convex polygon spanning many points?

Question

I have a list (about 200-300) of 2d points. I know that I need to find a polygon covering all of them. The polygon should be convex, and it should be as complex as possible (i.e. not a rectangular bounding box). He should find this as little time as possible, but there are no memory restrictions.

You can answer in pseudocode or in any language you want to use.

Answer 1

Sounds like you're looking for a convex hull algorithm ? More than ten years have passed since I was taught about this, but the name of Graham Skuck sticks to my opinion and is likely to be where I start.

Answer 2

Take a look at Graham's Algorithm .

Answer 3

Qhull - .

Answer 4

- , - ​​ .