@inproceedings{02efec8b72bc46aca59ae5d6188fe70c,

title = "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 of unit circles). We show that, similarly to penny graphs, it is NP-hard to recognize orthogonal unit circle intersection graphs.",

keywords = "COMPLEXITY, GRAPHS, RECOGNITION",

author = "Steven Chaplick and Henry F{\"o}rster and Myroslav Kryven and Alexander Wolff",

note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2019",

doi = "10.1007/978-3-030-35802-0_17",

language = "English",

isbn = "978-3-030-35801-3",

series = "Lecture Notes in Computer Science",

publisher = "Springer Nature Switzerland AG",

pages = "216--229",

editor = "D. Archambault and C. T{\'o}th",

booktitle = "Graph Drawing and Network Visualization. GD 2019",

}