English

Arrangements of Approaching Pseudo-Lines

Computational Geometry 2020-01-24 v1

Abstract

We consider arrangements of nn pseudo-lines in the Euclidean plane where each pseudo-line i\ell_i is represented by a bi-infinite connected xx-monotone curve fi(x)f_i(x), xRx \in \mathbb{R}, s.t.\ for any two pseudo-lines i\ell_i and j\ell_j with i<ji < j, the function xfj(x)fi(x)x \mapsto f_j(x) - f_i(x) is monotonically decreasing and surjective (i.e., the pseudo-lines approach each other until they cross, and then move away from each other). We show that such \emph{arrangements of approaching pseudo-lines}, under some aspects, behave similar to arrangements of lines, while for other aspects, they share the freedom of general pseudo-line arrangements. For the former, we prove: 1. There are arrangements of pseudo-lines that are not realizable with approaching pseudo-lines. 2. Every arrangement of approaching pseudo-lines has a dual generalized configuration of points with an underlying arrangement of approaching pseudo-lines. For the latter, we show: 1. There are 2Θ(n2)2^{\Theta(n^2)} isomorphism classes of arrangements of approaching pseudo-lines (while there are only 2Θ(nlogn)2^{\Theta(n \log n)} isomorphism classes of line arrangements). 2. It can be decided in polynomial time whether an allowable sequence is realizable by an arrangement of approaching pseudo-lines. Furthermore, arrangements of approaching pseudo-lines can be transformed into each other by flipping triangular cells, i.e., they have a connected flip graph, and every bichromatic arrangement of this type contains a bichromatic triangular cell.

Keywords

Cite

@article{arxiv.2001.08419,
  title  = {Arrangements of Approaching Pseudo-Lines},
  author = {Stefan Felsner and Alexander Pilz and Patrick Schnider},
  journal= {arXiv preprint arXiv:2001.08419},
  year   = {2020}
}