When three lines meet at a point, they are concurrent. For the diagonals of a 30-gon, out of the 16801 intersection points, there are 3001 points where three or more lines intersect, with 193 different ways to select three concurrent diagonals.

Consider six points that divide a circle into arcs . If , then the three lines connecting opposing points are concurrent [1]. This property was used to find the sets of lines. By the pizza theorem, half the circle is covered by wedges , and half by wedges .

In the initialization, {1,3,9,4,8,5,14} is a sample dataset (selected triple 102). The first six numbers are a partition of 30; the last number is the sector of the 30-gon where the intersection occurs.

References

[1] B. Poonen and M. Rubinstein, "The Number of Intersection Points Made by the Diagonals of a Regular Polygon," arxiv.org/abs/math/9508209.