/Euler-s-Triangulation

To find how many ways can n-sided polygon or n-gon can be divided into triangles? or how many ways does two lines can be drawn from vertex of n -polygon without lines intersecting

No issues in this repository yet.