Abstract
An arrangement of pseudocircles is a finite collection of Jordan curves in the plane with the additional properties that (i) no three of the curves meet in a point; (ii) every two curves meet in at most two points; and (iii) if two curves meet in a point p, then they cross at p.
We say that two arrangements b = (c1,…, c n ), D = (d1,…, d n ) are equivalent if there is a homeomorphism φ of the plane onto itself such that φ[c i ] = d i for all 1 ≤ i ≤ n. Linhart and Ortner (2005) gave an example of an arrangement of five pseudocircles that is not equivalent to an arrangement of circles, and conjectured that every arrangement of at most four pseudocircles is equivalent to an arrangement of circles. We prove their conjecture.
We consider two related recognition problems. The first is the problem of deciding, given a pseudocircle arrangement, whether it is equivalent to an arrangement of circles. The second is deciding, given a pseudocircle arrangement, whether it is equivalent to an arrangement of convex pseudocircles. We prove that both problems are NP-hard, answering questions of Bultena, Grünbaum and Ruskey (1998) and of Linhart and Ortner (2008).
We also give an example of a collection of convex pseudocircles with the property that its intersection graph (i.e. the graph with one vertex for each pseudocircle and an edge between two vertices if and only if the corresponding pseudocircles intersect) cannot be realized as the intersection graph of a collection of circles. This disproves a folklore conjecture communicated to us by Pyatkin.
Part of the work in this paper was done while this author was at Durham University, supported by EPSRC grant EP/G066604/1. He is now supported by a VENI grant from Netherlands Organisation for Scientific Research (NWO).
Part of the work in this paper was done while this author was supported by a VENI grant from Netherlands Organisation for Scientific Research (NWO).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. Bultena, B. Grünbaum and F. Ruskey, Convex drawings of intersecting families of simple closed curves, In: “11th Canadian Conference on Computational Geometry”, 1998, 18–21.
A. A. DOBRYNIN and L. S. Mel’nikov, Counterexamples to Grötzsch-Sachs-Koester’s conjecture, Discrete Math. 306(6) (2006), 591–594.
A. A. Dobrynin and L. S. Mel’nikov, Infinite families of 4-chromatic Grötzsch-Sachs graphs, J. Graph Theory 59(4) (2008), 279–292.
A. A. Dobrynin and L. S. Mel’nikov, 4-chromatic edge critical Grötzsch-Sachs graphs, Discrete Math. 309(8) (2009), 2564–2566.
J. E. Goodman and R. Pollack, Proof of Grünbaum’s conjecture on the stretchability of certain arrangements of pseudolines, J. Combin. Theory Ser. A 29(3) (1980), 385–390.
J. Linhart and R. Ortner, An arrangement of pseudocircles not realizable with circles, Beiträge Algebra Geom. 46(2) (2005), 351–356.
J. Linhart and R. Ortner, A note on convex realizability of arrangements of pseudocircles, Geombinatorics 18(2) (2008), 66–71.
N. E. Mnëv, The universality theorems on the classification problem of configuration varieties and convex polytopes varieties, In: “Topology and Geometry—Rohlin Seminar”, volume 1346 of Lecture Notes in Math., Springer, Berlin, 1988, 527–543.
A. V. Pyatkin. Personal communication, December 2011.
P. W. Shor, Stretchability of pseudolines is NP-hard, In: “Applied Geometry and Discrete Mathematics”, volume 4 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., Amer. Math. Soc., Providence, RI, 1991, 531–554.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2013 Scuola Normale Superiore Pisa
About this paper
Cite this paper
Kang, R.J., Müller, T. (2013). Arrangements of pseudocircles and circles. In: Nešetřil, J., Pellegrini, M. (eds) The Seventh European Conference on Combinatorics, Graph Theory and Applications. CRM Series, vol 16. Edizioni della Normale, Pisa. https://doi.org/10.1007/978-88-7642-475-5_29
Download citation
DOI: https://doi.org/10.1007/978-88-7642-475-5_29
Publisher Name: Edizioni della Normale, Pisa
Print ISBN: 978-88-7642-474-8
Online ISBN: 978-88-7642-475-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)