COMBINATORIAL COMPLEXITY OF SIGNED DISCS

被引：0
|
作者：
SOUVAINE, DL
YAP, CK
机构：
[1] RUTGERS STATE UNIV,DEPT COMP SCI,NEW BRUNSWICK,NJ 08903
[2] NYU,COURANT INST MATH SCI,NEW YORK,NY 10012
来源：
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 1995年 / 5卷 / 04期
基金：
美国国家科学基金会;
关键词：
D O I：
10.1016/0925-7721(94)00026-X
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let C+ and C- be two collections of topological discs. The collection of discs is 'topological' in the sense that their boundaries are Jordan curves and each pair of Jordan curves intersect at most twice. We prove that the region U C+ - U C- has combinatorial complexity at most 10n - 30 where p = \C+\, q = \C-\ and n = p + q greater than or equal to 5. Moreover, this bound is achievable. We also show less precise bounds that are stated as functions of p and q.
引用
收藏
页码：207 / 223
页数：17
相关论文
共 50 条
12345