Polygon Diagonal

CatalanPolygons

A polygonal diagonal is a line segment connecting two nonadjacent polygon vertices of a polygon. The number of ways a fixed convex n-gon can be divided into triangles by nonintersecting diagonals is C_(n-2) (with C_(n-3) diagonals), where C_n is a Catalan number. This is Euler's polygon division problem. Counting the number of regions determined by drawing the diagonals of a regular n-gon is a more difficult problem, as is determining the number of n-tuples of concurrent diagonals (Kok 1972).

The number of regions which the diagonals of a convex polygon divide its center if no three are concurrent in its interior is

N=(n; 4)+(n-1; 2)
(1)
=1/(24)(n-1)(n-2)(n^2-3n+12).
(2)

The first few values are 0, 0, 1, 4, 11, 25, 50, 91, 154, 246, ... (OEIS A006522).

Wolfram Web Resources

Mathematica »

The #1 tool for creating Demonstrations and anything technical.

Wolfram|Alpha »

Explore anything with the first computational knowledge engine.

Wolfram Demonstrations Project »

Explore thousands of free applications across science, mathematics, engineering, technology, business, art, finance, social sciences, and more.

Computerbasedmath.org »

Join the initiative for modernizing math education.

Online Integral Calculator »

Solve integrals with Wolfram|Alpha.

Step-by-step Solutions »

Walk through homework problems step-by-step from beginning to end. Hints help you try the next step on your own.

Wolfram Problem Generator »

Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet.

Wolfram Education Portal »

Collection of teaching and learning tools built by Wolfram education experts: dynamic textbook, lesson plans, widgets, interactive Demonstrations, and more.

Wolfram Language »

Knowledge-based programming for everyone.