Abstract
AbstractWe consider arrangements ofnpseudo-lines in the Euclidean plane where each pseudo-line$$\ell _i$$ℓiis represented by a bi-infinite connectedx-monotone curve$$f_i(x)$$fi(x),$$x \in \mathbb {R}$$x∈R, such that for any two pseudo-lines$$\ell _i$$ℓiand$$\ell _j$$ℓjwith$$i \!<\! j$$i<j, the function$$x \!\mapsto \! f_j(x) \!-\! f_i(x)$$x↦fj(x)-fi(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 sucharrangements 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:There are arrangements of pseudo-lines that are not realizable with approaching pseudo-lines.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:There are$$2^{\Theta (n^2)}$$2Θ(n2)isomorphism classes of arrangements of approaching pseudo-lines (while there are only$$2^{\Theta (n \log n)}$$2Θ(nlogn)isomorphism classes of line arrangements).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.
Funder
Deutsche Forschungsgemeinschaft
Austrian Science Fund
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference21 articles.
1. Aichholzer, O., Hackl, T., Lutteropp, S., Mchedlidze, T., Pilz, A., Vogtenhuber, B.: Monotone simultaneous embeddings of upward planar digraphs. J. Graph Algorithms Appl. 19(1), 87–110 (2015)
2. Aigner, M., Ziegler, G.M.: Proofs from THE BOOK. Springer, Berlin (2014)
3. Asinowski, A.: Suballowable sequences and geometric permutations. Discret. Math. 308(20), 4745–4762 (2008)
4. Björner, A., Las Vergnas, M., Sturmfels, B., White, N., Ziegler, G.M.: Oriented Matroids. Encyclopedia of Mathematics and its Applications, vol. 46. Cambridge University Press, Cambridge (1993)
5. Eppstein, D.: Drawing arrangement graphs in small grids, or how to play planarity. J. Graph Algorithms Appl. 18(2), 211–231 (2014)