We show how to construct an arrangement of n lines having a monotone path of length Ω(n2-(d/√logn), where d > 0 is some constant, and thus nearly settle the long standing question on monotone path length in line arrangements.
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics