未找到相关数据
The Maximal Number of Geometric Permutations for n Disjoint Translates of a Convex Set in ℝ Is Ω(n)
被引：0
作者：
Andrei Asinowski
Meir Katchalski
机构：
[1] Faculty of Mathematics,
[2] Technion-Israel Institute of Technology,undefined
[3] Haifa 32000,undefined
来源：
Discrete & Computational Geometry
|
2006年
/
35卷
关键词：
Computational Mathematic;
Finite Family;
Transversal Line;
Geometric Permutation;
Disjoint Translate;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A geometric permutation induced by a transversal line of a finite family of disjoint convex sets in ℝd is the order in which the transversal meets the members of the family. It is known that the maximal number of geometric permutations in families of n disjoint translates of a convex set in ℝ3 is 3. We prove that for d ≥ 3 the maximal number of geometric permutations for such families in ℝd is Ω(n).
引用
收藏
页码：473 / 480
页数：7
相关论文