Lower bounds on the length of monotone paths in arrangements
- 60 Downloads
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).
Unable to display preview. Download preview PDF.
- [CMS] R. Cole, N. Megiddo, M. Sharir: On monotone tours of arrangements of lines in the plane, Manuscript, 1988.Google Scholar
- [EG] H. Edelsbrunner, L. J. Guibas: Topologically sweeping an arrangement,Proc. 18th Symp. on Theory of Computing, 1986, pp. 389–403.Google Scholar
- [Y] P. Yamamoto, Private communication.Google Scholar
- [YKII] P. Yamamoto, K. Kato, K. Imai, H. Imai: Algorithms for vertical and orthogonalL 1 linear approximation of points,Proc. 4th ACM Sympos. on Computing Geometry, 1988 (also to appear inAlgorithmica).Google Scholar
© Springer-Verlag New York Inc 1991