Arrangements of Pseudocircles: On Digons and Triangles

08/25/2022
by   Stefan Felsner, et al.
0

In this article, we study the cell-structure of simple arrangements of pairwise intersecting pseudocircles. The focus will be on two problems from Grünbaum's monograph from the 1970's. First, we discuss the maximum number of digons or touching points. Grünbaum conjectured that there are at most 2n-2 digon cells or equivalently at most 2n-2 touchings. Agarwal et al. (2004) verified the conjecture for cylindrical arrangements. We show that the conjecture holds for any arrangement which contains three pseudocircles that pairwise form a touching. The proof makes use of the result for cylindrical arrangements. Moreover, we construct non-cylindrical arrangements which attain the maximum of 2n-2 touchings and have no triple of pairwise touching pseudocircles. Second, we discuss the minimum number of triangular cells (triangles) in arrangements without digons and touchings. Felsner and Scheucher (2017) showed that there exist arrangements with only ⌈16/11n ⌉ triangles, which disproved a conjecture of Grünbaum. Here we provide a construction with only ⌈4/3n ⌉ triangles. A corresponding lower bound was obtained by Snoeyink and Hershberger (1991).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/21/2017

Arrangements of Pseudocircles: Triangles and Drawings

A pseudocircle is a simple closed curve on the sphere or in the plane. T...
research
03/24/2023

Roudneff's Conjecture in Dimension 4

J.-P. Roudneff conjectured in 1991 that every arrangement of n ≥ 2d+1≥ 5...
research
08/10/2019

Avoidable paths in graphs

We prove a recent conjecture of Beisegel et al. that for every positive ...
research
07/05/2019

Subspaces intersecting in at most a point

We improve on the lower bound of the maximum number of planes in PG(8,q)...
research
03/20/2018

The Crossing Number of Seq-Shellable Drawings of Complete Graphs

The Harary-Hill conjecture states that for every n>0 the complete graph ...
research
03/19/2023

Extending a triangulation from the 2-sphere to the 3-ball

Define the tet-volume of a triangulation of the 2-sphere to be the minim...
research
06/06/2019

On the distribution of runners on a circle

Consider n runners running on a circular track of unit length with const...

Please sign up or login with your details

Forgot password? Click here to reset