TY - JOUR
AU1 - Dumitrescu, Adrian
AU2 - Mandal, Ritankar
AU3 - Tóth, Csaba
AB - (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.
TI - Monotone Paths in Geometric Triangulations
JF - Theory of Computing Systems
DO - 10.1007/s00224-018-9855-4
DA - 2018-02-28
UR - https://www.deepdyve.com/lp/springer-journals/monotone-paths-in-geometric-triangulations-OAIdnXo0nL
SP - 1490
EP - 1524
VL - 62
IS - 6
DP - DeepDyve
ER -