Long monotone paths in line arrangements

Authors:
Jazsef Balogh;Oded Regev;Clifford Smyth;William Steiger;Mario Szegedy
Affiliations:
The Ohio State University;Institute for Advanced Study, Princeton, NJ;Carnegie-Mellon University, Pittsburgh, PA;Rutgers University;Rutgers University
Venue:
Proceedings of the nineteenth annual symposium on Computational geometry
Year:
2003

Citing 3
Cited 0

Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
Lower bounds on the length of monotone paths in arrangements

Discrete & Computational Geometry
Monotone paths in line arrangement

SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show how to construct an arrangement of n lines having a monotone path of length O(n2-(d/vlog n)), where d0 is some constant, and thus nearly settle the long standing question on monotone path length in line arrangements.