论文部分内容阅读
所谓多边形分割,是指下面的问题:n边形A1A2A3…An中,若无三条对角线交于一点,问所有对角线将n边形分割成多少块?此问题在《数学通报》(2006年第8期)“三角形与多边形分割”一文中已有解答
The so-called polygon segmentation refers to the following problem: If there are no three diagonal lines intersecting at one point in the n-sided polygon A1A2A3...An, ask how many diagonal lines will divide the n-gonal into several blocks. This problem is in the “Mathematical Bulletin” ( There has been a solution to the article “” triangle and polygon segmentation "