On Weighted Sums of Numbers of Convex Polygons in Point Sets

Discrete & Computational Geometry(2022)

引用 0|浏览35
暂无评分
摘要
Let S be a set of n points in general position in the plane, and let X_k,ℓ(S) be the number of convex k -gons with vertices in S that have exactly ℓ points of S in their interior. We prove several equalities for the numbers X_k,ℓ(S) . This problem is related to the Erdős–Szekeres theorem. Some of the obtained equations also extend known equations for the numbers of empty convex polygons to polygons with interior points. Analogous results for higher dimension are shown as well.
更多
查看译文
关键词
Erdős–Szekeres type problems,Empty convex polygons,Planar point sets
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要