Maximum number of triangles that can be formed with a given set of vertex points

719 Views Asked by At

We have a convex polygon with $M$ vertices, and $N$ points inside the polygon. Let $X$ be the set of these $M+N$ points. We know that there aren't $3$ collinear points in $X$. We want to divide the polygon into triangles that have their vertices in $X$ and such that their sides intersect only in the vertices. What is the maximum number of triangles we can obtain?

1

There are 1 best solutions below

7
On

Hints:

  • How many triangles can you draw with $M$ external vertices and $0$ internal vertices?

  • If you introduce an additional vertex inside an existing triangles, how many extra triangles can you draw (taking account of the one you break up)?