TY - GEN

T1 - Arrangements of pseudocircles

T2 - 25th International Symposium on Graph Drawing and Network Visualization, GD 2017

AU - Felsner, Stefan

AU - Scheucher, Manfred

PY - 2018/1/1

Y1 - 2018/1/1

N2 - A pseudocircle is a simple closed curve on the sphere or in the plane. The study of arrangements of pseudocircles was initiated by Grünbaum, who defined them as collections of simple closed curves that pairwise intersect in exactly two crossings. Grünbaum conjectured that the number of triangular cells p3 in digon-free arrangements of n pairwise intersecting pseudocircles is at least 2n - 4 We present examples to disprove this conjecture. With a recursive construction based on an example with 12 pseudocircles and 16 triangles we obtain a family with p3(A)/n → 16/11 = 1.45. We expect that the lower bound p3(A) ≥ 4n/3 is tight for infinitely many simple arrangements. It may however be that digon-free arrangements of n pairwise intersecting circles indeed have at least 2n - 4 triangles. For pairwise intersecting arrangements with digons we have a lower bound of p3 ≥ 2n/3, and conjecture that p3 ≥ n - 1. Concerning the maximum number of triangles in pairwise intersecting arrangements of pseudocircles, we show that p3 ≤ 2n2/3+O(n). This is essentially best possible because families of pairwise intersecting arrangements of n pseudocircles with p3/n2 → 2/3 as n→∞ are known. The paper contains many drawings of arrangements of pseudocircles and a good fraction of these drawings was produced automatically from the combinatorial data produced by the generation algorithm. In the final section we describe some aspects of the drawing algorithm.

AB - A pseudocircle is a simple closed curve on the sphere or in the plane. The study of arrangements of pseudocircles was initiated by Grünbaum, who defined them as collections of simple closed curves that pairwise intersect in exactly two crossings. Grünbaum conjectured that the number of triangular cells p3 in digon-free arrangements of n pairwise intersecting pseudocircles is at least 2n - 4 We present examples to disprove this conjecture. With a recursive construction based on an example with 12 pseudocircles and 16 triangles we obtain a family with p3(A)/n → 16/11 = 1.45. We expect that the lower bound p3(A) ≥ 4n/3 is tight for infinitely many simple arrangements. It may however be that digon-free arrangements of n pairwise intersecting circles indeed have at least 2n - 4 triangles. For pairwise intersecting arrangements with digons we have a lower bound of p3 ≥ 2n/3, and conjecture that p3 ≥ n - 1. Concerning the maximum number of triangles in pairwise intersecting arrangements of pseudocircles, we show that p3 ≤ 2n2/3+O(n). This is essentially best possible because families of pairwise intersecting arrangements of n pseudocircles with p3/n2 → 2/3 as n→∞ are known. The paper contains many drawings of arrangements of pseudocircles and a good fraction of these drawings was produced automatically from the combinatorial data produced by the generation algorithm. In the final section we describe some aspects of the drawing algorithm.

UR - http://www.scopus.com/inward/record.url?scp=85041803929&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-73915-1_11

DO - 10.1007/978-3-319-73915-1_11

M3 - Conference paper

AN - SCOPUS:85041803929

SN - 9783319739144

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 127

EP - 139

BT - Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Revised Selected Papers

PB - Springer Verlag Heidelberg

Y2 - 25 September 2017 through 27 September 2017

ER -