Number of ways to partition a convex polygon
1 Articles
1 Articles
Number of ways to partition a convex polygon
In this post we want to count the number of ways to divide a regular polygon [1] into triangles by connecting vertices with straight lines that do not cross. Squares For a square, there are two possibilities: we either connect the NW and SE corners, or we connect the SW and NE corners. Pentagons For a pentagon, we pick one vertex and connect it to both non-adjacent vertices. We can do this for any vertex, so there are five possible triangulation…
Coverage Details
Bias Distribution
- There is no tracked Bias information for the sources covering this story.
To view factuality data please Upgrade to Premium
Ownership
To view ownership data please Upgrade to Vantage