Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Monotone Paths in Geometric Triangulations

Monotone Paths in Geometric Triangulations (I) We prove that the (maximum) number of monotone paths in a geometric triangulation of n points in the plane is O(1.7864 n ). This improves an earlier upper bound of O(1.8393 n ); the current best lower bound is Ω(1.7003 n ). (II) Given a planar geometric graph G with n vertices, we show that the number of monotone paths in G can be computed in O(n 2) time. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Theory of Computing Systems Springer Journals

Monotone Paths in Geometric Triangulations

Download PDF
35 pages

Loading next page...
 
/lp/springer_journal/monotone-paths-in-geometric-triangulations-OAIdnXo0nL
Publisher
Springer Journals
Copyright
Copyright © 2018 by Springer Science+Business Media, LLC, part of Springer Nature
Subject
Computer Science; Theory of Computation
ISSN
1432-4350
eISSN
1433-0490
DOI
10.1007/s00224-018-9855-4
Publisher site
See Article on Publisher Site

Abstract

(I) We prove that the (maximum) number of monotone paths in a geometric triangulation of n points in the plane is O(1.7864 n ). This improves an earlier upper bound of O(1.8393 n ); the current best lower bound is Ω(1.7003 n ). (II) Given a planar geometric graph G with n vertices, we show that the number of monotone paths in G can be computed in O(n 2) time.

Journal

Theory of Computing Systems – Springer Journals

Published: Feb 28, 2018

References

  • Crossing-free subgraphs
    Ajtai, M; Chvátal, V; Newborn, M; Szemerédi, E
  • Computational Geometry
    Berg, M; Cheong, O; Kreveld, M; Overmars, M
  • Counting carambolas
    Dumitrescu, A; Löffler, M; Schulz, A; Tóth, CsD
  • Bounds on the maximum multiplicity of some common geometric graphs
    Dumitrescu, A; Schulz, A; Sheffer, A; Tóth, CsD
  • Computational Geometry Column 54
    Dumitrescu, A; Tóth, CsD
  • Convex polygons in geometric triangulations
    Dumitrescu, A; Tóth, CsD
  • Lower bounds on the number of crossing-free subgraphs of KN
    García, A; Noy, M; Tejel, A
  • Two new bounds for the random-edge simplex-algorithm
    Gärtner, B; Kaibel, V
  • The simplex algorithm in dimension three
    Kaibel, V; Mechtel, R; Sharir, M; Ziegler, GM
  • Upper bounds for the diameter and height of graphs of convex polyhedra
    Kalai, G
  • Paths on polyhedra I
    Klee, V
  • RANDOM EDGE can be exponential on abstract cubes
    Matoušek, J; Szabó, T
  • Monotone drawings of planar graphs
    Pach, J; Tóth, G
  • Number of crossing-free geometric graphs vs. triangulations
    Razen, A; Snoeyink, J; Welzl, E
  • A counterexample to the Hirsch conjecture
    Santos, F
  • Recent progress on the combinatorial diameter of polytopes and simplicial complexes
    Santos, F
  • Counting triangulations of planar point sets
    Sharir, M; Sheffer, A
  • Counting plane graphs: cross-graph charging schemes
    Sharir, M; Sheffer, A
  • Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn’s technique
    Sharir, M; Sheffer, A; Welzl, E
  • On the number of crossing-free matchings, cycles, and partitions
    Sharir, M; Welzl, E
  • The monotonic bounded Hirsch conjecture is false for dimension at least 4
    Todd, MJ
  • An improved Kalai-Kleitman bound for the diameter of a polyhedron
    Todd, MJ