Non Self Intersecting Polygons?

1.8k Views Asked by At

Given a set of n points is it always possible to construct a non self intersecting polygon?

1

There are 1 best solutions below

0
On BEST ANSWER

Choose a point $x_0$ of your set and order the other points around $x_0$ counter-clockwise. Label them $x_1,x_2,\ldots x_{n-1}$ according to that order. You get a non intersecting polygon and $x_0$ is in its kernel.