A quadratic lower bound for colourful simplicial depth

被引：0
|
作者：
Tamon Stephen
Hugh Thomas
机构：
[1] Simon Fraser University,Department of Mathematics
[2] University of New Brunswick,Department of Mathematics and Statistics
来源：
Journal of Combinatorial Optimization | 2008年 / 16卷
关键词：
Computational geometry; Carathéodory theorem; Colourful Carathéodory theorem; Simplicial depth; Colourful simplicial depth;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We show that any point in the convex hull of each of (d+1) sets of (d+1) points in ℝd is contained in at least ⌊(d+2)2/4⌋ simplices with one vertex from each set.
引用
收藏
页码：324 / 327
页数：3
相关论文
共 50 条
12345