A Geometric Approach for the Upper Bound Theorem for Minkowski Sums of Convex Polytopes

Discrete & Computational Geometry（2016）

引用 3|浏览13

暂无评分

摘要

We derive tight expressions for the maximum number of k -faces, 0≤k≤d-1 , of the Minkowski sum, P_1+⋯ +P_r , of r convex d -polytopes P_1,… ,P_r in ℝ^d , where d≥2 and r更多

查看译文

关键词

Discrete geometry,Combinatorial geometry,Combinatorial complexity,Minkowski sum,Convex polytopes,Upper bound

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要