Arrangements of Approaching Pseudo-Lines
- PMID: 35221404
- PMCID: PMC8818014
- DOI: 10.1007/s00454-021-00361-w
Arrangements of Approaching Pseudo-Lines
Abstract
We consider arrangements of n pseudo-lines in the Euclidean plane where each pseudo-line is represented by a bi-infinite connected x-monotone curve , , such that for any two pseudo-lines and with , the function 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 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: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 isomorphism classes of arrangements of approaching pseudo-lines (while there are only 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.
Keywords: Discrete geometry; Order types; Pseudo-line arrangements.
© The Author(s) 2022.
Figures
References
-
- Aichholzer O, Hackl T, Lutteropp S, Mchedlidze T, Pilz A, Vogtenhuber B. Monotone simultaneous embeddings of upward planar digraphs. J. Graph Algorithms Appl. 2015;19(1):87–110. doi: 10.7155/jgaa.00350. - DOI
-
- Aigner M, Ziegler GM. Proofs from THE BOOK. Berlin: Springer; 2014.
-
- Asinowski A. Suballowable sequences and geometric permutations. Discret. Math. 2008;308(20):4745–4762. doi: 10.1016/j.disc.2007.08.086. - DOI
-
- Björner A, Las Vergnas M, Sturmfels B, White N, Ziegler GM. Oriented Matroids. Encyclopedia of Mathematics and its Applications. Cambridge: Cambridge University Press; 1993.
-
- Eppstein D. Drawing arrangement graphs in small grids, or how to play planarity. J. Graph Algorithms Appl. 2014;18(2):211–231. doi: 10.7155/jgaa.00319. - DOI
LinkOut - more resources
Full Text Sources