volume 26, issue 4, P465-492 2001
DOI: 10.1007/s00454-001-0043-x
View full text
|
|
Share

Abstract: AbstractContinuing and extending the analysis in a previous paper 14], we establish several combinatorial results on the complexity of arrangements of circles in the plane. The main results are a collection of partial solutions to the conjecture that (a) any arrangement of unit circles with at least one intersecting pair has a vertex incident to at most 3 circles, and (b) any arrangement of circles of arbitrary radii with at least one intersecting pair has a vertex incident to at most 3 circles, under appropr…

Expand abstract

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

4
26
0

Publication Types

Select...

Relationship

0
0

Authors

Journals