Arrangements of approaching pseudo-lines
From MaRDI portal
Publication:2117345
Abstract: We consider arrangements of pseudo-lines in the Euclidean plane where each pseudo-line is represented by a bi-infinite connected -monotone curve , , s.t. 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 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 isomorphism classes of arrangements of approaching pseudo-lines (while there are only 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 4092241 (Why is no real title available?)
- scientific article; zbMATH DE number 53152 (Why is no real title available?)
- scientific article; zbMATH DE number 1124651 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- Arrangements and Topological Planes
- Drawing arrangement graphs in small grids, or how to play Planarity
- Every arrangement extends to a spread
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
- Helly-type theorems for pseudoline arrangments in P^ 2.
- Monotone simultaneous embeddings of upward planar digraphs
- On the number of reduced decompositions of elements of Coxeter groups
- Polynomial realization of pseudoline arrangements
- Proof of a conjecture of Burr, Grünbaum, and Sloane
- Proofs from THE BOOK
- Semispaces of configurations, cell complexes of arrangements
- Suballowable sequences and geometric permutations
- Teilungen der Ebenen durch Geraden oder topologische Geraden
- Triangles in Euclidean arrangements
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
Cited in
(2)
This page was built for publication: Arrangements of approaching pseudo-lines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117345)