Location of Repository

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) / log log(n/k)) edges that is monotone in some direction. This bound is also the best possible. Our methods are constructive and lead to efficient algorithms for computing monotone paths of lengths specified above. 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² n) edges. We can also construct a similar polytope Q, with unbounded degree however, such that every monotone path on the 1-skeleton of Q has at most O(log n) edges

Topics:
Monotone path, convex subdivision, geometric graph, convex polytope

Year: 2012

OAI identifier:
oai:CiteSeerX.psu:10.1.1.358.9432

Provided by:
CiteSeerX

Download PDF:To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.