On the complexity of many faces in arrangements of circles

被引：1

作者：

Agarwal, PK ^{[1
]}

Aronov, B ^{[1
]}

Sharir, M ^{[1
]}

机构：

[1] Duke Univ, Dept Comp Sci, Durham, NC 27708 USA

来源：

42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS | 2001年

关键词：

D O I：

10.1109/SFCS.2001.959882

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We obtain improved bounds on the complexity of in distinct faces in an arrangement of n circles and in an arrangement of n unit circles. The bounds are worst-case tight for unit circles, and, for general circles, they nearly coincide with the best known bounds for the number of incidences between in points and n circles.

引用

页码：74 / 83

页数：10

共 21 条

[1]

AGARWAL P, UNPUB LENSES ARRANGE

[2]

AGARWAL P, UNPUB COMPUTING DETO

[3]

Agarwal PK, 2000, HANDBOOK OF COMPUTATIONAL GEOMETRY, P49, DOI 10.1016/B978-044482537-7/50003-6

[4] Computing many faces in arrangements of lines and segments [J].