On some monotone path problems in line arrangements

We estimate the minimum length of a longest monotone path in an arrangement of n lines, where length counts the number of turns on the path. Estimates are also obtained for the case when length counts the number of visited vertices. Our bounds are asymptotically tight. When length is defined as the size of a convex/concave chain in the arrangement an exact bound is obtained.