Lower bounds on the length of monotone paths in arrangements

We show that the maximal number of turns of anx-monotone path in an arrangement ofn lines is Ω(n5/3) and the maximal number of turns of anx-monotone path in arrangement ofn pseudolines is Ω(n2/logn).

[1]  Richard Pollack,et al.  Upper bounds for configurations and polytopes inRd , 1986, Discret. Comput. Geom..

[2]  Leonidas J. Guibas,et al.  Topologically sweeping an arrangement , 1986, STOC '86.

[3]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[4]  Hiroshi Imai,et al.  Algorithms for vertical and orthogonal L1 linear approximation of points , 1988, SCG '88.