A short proof of an interesting Helly-type theorem

被引：11
|
作者：
Amenta, N
机构：
[1] Geometry Center, Minneapolis, MN 55454
来源：
DISCRETE & COMPUTATIONAL GEOMETRY | 1996年 / 15卷 / 04期
关键词：
D O I：
10.1007/BF02711517
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We give a shortproof of the theorem that any family of subsets of R(d), With the property that the intersection of any nonempty finite subfamily can be represented as the disjoint union of at most k closed convex sets, has Helly number at most k(d + 1).
引用
收藏
页码：423 / 427
页数：5
相关论文
共 50 条
12345