Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2022;67(2):380-402.
doi: 10.1007/s00454-021-00361-w. Epub 2022 Jan 22.

Arrangements of Approaching Pseudo-Lines

Affiliations

Arrangements of Approaching Pseudo-Lines

Stefan Felsner et al. Discrete Comput Geom. 2022.

Abstract

We consider arrangements of n pseudo-lines in the Euclidean plane where each pseudo-line i is represented by a bi-infinite connected x-monotone curve f i ( x ) , x R , such that for any two pseudo-lines i and j with i < j , the function x 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 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 2 Θ ( n 2 ) isomorphism classes of arrangements of approaching pseudo-lines (while there are only 2 Θ ( n log n ) 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.

PubMed Disclaimer

Figures

Fig. 1
Fig. 1
Vertical translation of the red lines shows that there is always a bichromatic triangle in a bichromatic line arrangement (left). For pseudo-line arrangements, a vertical translation may result in a structure that is no longer a valid pseudo-line arrangement (right)
Fig. 2
Fig. 2
Transforming an arrangement of approaching pseudo-lines into an isomorphic one of approaching polygonal pseudo-lines
Fig. 3
Fig. 3
A line arrangement A0 (left) and the arrangements A and A used for the transformation from A to A0
Fig. 4
Fig. 4
An approaching generalized configuration (left) and its dual approaching arrangement (right)
Fig. 5
Fig. 5
A part of a six-element pseudo-line arrangement (bold) whose suballowable sequence (indicated by the vertical lines) is non-realizable (adapted from [, Fig. 4]). Adding the two thin pseudo-lines crossing in the vicinity of the vertical line crossed by the pseudo-lines in the order of π1 and doing the same for π2 enforces that the allowable sequence of any isomorphic arrangement contains the subsequence (id,π1,π2)
Fig. 6
Fig. 6
A construction for an 2Ω(n2) lower bound on the isomorphism classes of approaching arrangements
Fig. 7
Fig. 7
An illustration of a neighborhood of a touching point
Fig. 8
Fig. 8
Two different arrangements induced by the same order type

References

    1. 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
    1. Aigner M, Ziegler GM. Proofs from THE BOOK. Berlin: Springer; 2014.
    1. Asinowski A. Suballowable sequences and geometric permutations. Discret. Math. 2008;308(20):4745–4762. doi: 10.1016/j.disc.2007.08.086. - DOI
    1. 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.
    1. 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