# Monotone Paths in Planar Convex Subdivisions

## Abstract

Consider a connected subdivision of the plane into *n* convex faces where every vertex is incident to at most Δ edges. Then, starting from every vertex there is a path with at least Ω(log_{Δ} *n*) edges that is monotone in some direction. This bound is the best possible. Consider now a connected subdivision of the plane into *n* convex faces where exactly *k* faces are unbounded. Then, there is a path with at least Ω(log(*n*/*k*)/loglog(*n*/*k*)) edges that is monotone in some direction. This bound is also the best possible.

In 3-space, we show that for every *n* ≥ 4, there exists a polytope *P* with *n* vertices, bounded vertex degrees, and triangular faces such that every monotone path on the 1-skeleton of *P* has at most *O*(log^{2} *n*) edges. We also construct a polytope *Q* with *n* vertices, and triangular faces, (with unbounded degree however), such that every monotone path on the 1-skeleton of *Q* has at most *O*(log*n*) edges.

## Keywords

Simple Polygon Geometric Graph Interior Vertex Weakly Monotone Face Incident## Preview

Unable to display preview. Download preview PDF.

## References

- 1.Balogh, J., Regev, O., Smyth, C., Steiger, W., Szegedy, M.: Long monotone paths in line arrangements. Discrete & Comput. Geom. 32, 167–176 (2004)MathSciNetMATHGoogle Scholar
- 2.Chazelle, B., Edelsbrunner, H., Guibas, L.J.: The complexity of cutting complexes. Discrete & Comput. Geom. 4, 139–181 (1989)MathSciNetMATHCrossRefGoogle Scholar
- 3.Dumitrescu, A., Tóth, C.D.: Monotone paths in planar convex subdivisions. In: Abstracts of the 21st Fall Workshop on Comput. Geom., NY (2011)Google Scholar
- 4.McMullen, P.: The maximum numbers of faces of a convex polytope. Mathematika 17, 179–184 (1971)MathSciNetCrossRefGoogle Scholar
- 5.Radoičić, R., Tóth, G.: Monotone paths in line arrangements. Comput. Geom. 24, 129–134 (2003)MathSciNetMATHCrossRefGoogle Scholar
- 6.Rote, G.: Long monotone paths in convex subdivisions In: Abstracts of the 27th European Workshop on Comput. Geom., Morschach, pp. 183–184 (2011)Google Scholar
- 7.Santos, F.: A counterexample to the Hirsch conjecture. Annals of Mathematics 176, 383–412 (2012)CrossRefGoogle Scholar
- 8.Todd, M.J.: The monotonic bounded Hirsch conjecture is false for dimension at least 4. Math. Oper. Res. 5(4), 599–601 (1980)MathSciNetMATHCrossRefGoogle Scholar
- 9.Tóth, C.D.: Stabbing numbers of convex subdivisions. Period. Math. Hung. 57(2), 217–225 (2008)MATHCrossRefGoogle Scholar
- 10.Ziegler, G.M.: Lectures on Polytopes. GTM, vol. 152, pp. 83–93. Springer (1994)Google Scholar