I have a set of points in the plane and I want to find all convex polygons without including a point inside them.

For example I want to find all triangles, all four sized polygons, all four five sized polygons and so on until is possible to find them without including a point inside them.

In the image, row **a** corresponds to convex polygons of size 3. While column 1 and 2 show correct examples of what I want, column 3 shows a triangle including two points inside of it, which I dont want.

Rows **b** and **c** show examples of polygons of size 4 and 5.

**b3** shows an example of a non convex polygon

![enter image description here](https://i.stack.imgur.com/Yaglf.png)

I wonder if there is a function in MATLAB or any other language or if someone knows about an algorithm that can do it.

The algorithm could receive, beside the points, the size of the polygons to search, it would return all possibly correct polygons or empty if does not contain any polygon of that size.

I appreciate the help.