At Least n – 1 Intersection Points in a Connected Family of n Unit Circles in the Plane

被引：0
|
作者：
Hagit Last
Rom Pinchasi
机构：
[1] Institute of Mathematics,
[2] Hebrew University of Jerusalem,undefined
[3] Department of Mathematics,undefined
[4] Israel Institute of Technology,undefined
[5] Technion,undefined
来源：
Discrete & Computational Geometry | 2007年 / 38卷
关键词：
Intersection Point; Unit Circle; Weak Couple; Discrete Comput Geom; Simple Closed Curf;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Let C be a family of n different unit circles in the plane. We show that C determines at least n - c intersection points, where c is the number of connected components in ∪C ∈ CC. This proves a conjecture of A. Bezdek.
引用
收藏
页码：321 / 354
页数：33
相关论文
共 50 条
12345