2019
DOI: 10.1007/978-3-030-35802-0_17
|View full text |Cite
|
Sign up to set email alerts
|

On Arrangements of Orthogonal Circles

Abstract: In this paper, we study arrangements of orthogonal circles, that is, arrangements of circles where every pair of circles must either be disjoint or intersect at a right angle. Using geometric arguments, we show that such arrangements have only a linear number of faces. This implies that orthogonal circle intersection graphs have only a linear number of edges. When we restrict ourselves to orthogonal unit circles, the resulting class of intersection graphs is a subclass of penny graphs (that is, contact graphs … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
2
1
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 22 publications
0
5
0
Order By: Relevance
“…We begin by stating a few properties of arrangements of orthogonal circles. The first lemma was proven by Chaplick et al [4]. Proof.…”
Section: Bounds For General Orthogonal Arrangementsmentioning
confidence: 89%
See 4 more Smart Citations
“…We begin by stating a few properties of arrangements of orthogonal circles. The first lemma was proven by Chaplick et al [4]. Proof.…”
Section: Bounds For General Orthogonal Arrangementsmentioning
confidence: 89%
“…We apply a Möbius transformation that maps A to a line. Note that such a transformation is conformal and thus maintains the angles; see Figure The following lemma is again taken from Chaplick et al [4,Lemma 5]. The "Moreover"-part is not explicitly written down, but it is apparent from the construction given in its proof.…”
Section: Bounds For General Orthogonal Arrangementsmentioning
confidence: 99%
See 3 more Smart Citations