Covering a Convex Polygon by Triangles

被引：0

作者：

András Bezdek

机构：

[1] Auburn University,Alfréd Rényi Institute of Mathematics,Hungarian Academy of Sciences and Department of Mathematics

来源：

Geometriae Dedicata | 2000年 / 80卷

关键词：

convex set; triangle; polygon;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

According to a theorem of A. V. Bogomolnaya, F. L. Nazarov and S. E. Rukshin, if n points are given inside a convex n-gon, then the points and the sides of the polygon can be numbered from 1 to n so that the triangles spanned by the ith point and the ith side(i=1....,n ) cover the polygon. In this paper, we prove that the same can be done without assuming that the given points are inside the convex n-gon. We also show that in the general case at least [(n/3)] mutually nonoverlapping triangles can be constructed in the same manner.

引用

页码：73 / 79

页数：6