Computational geometry: an introduction
Computational geometry: an introduction
Shortest paths in Euclidean graphs
Algorithmica
There is a planar graph almost as good as the complete graph
SCG '86 Proceedings of the second annual symposium on Computational geometry
Approximating k-Spanner Problems for k2
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Online Routing in Triangulations
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
On the Spanning Ratio of Gabriel Graphs and beta-skeletons
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
The Hardness of Approximating Spanner Problems
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On the stretch factor of Delaunay triangulations of points in convex position
Computational Geometry: Theory and Applications
Improved upper bound on the stretch factor of delaunay triangulations
Proceedings of the twenty-seventh annual symposium on Computational geometry
On generalized diamond spanners
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
The stretch factor of L1- and L∞-delaunay triangulations
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |
Let S be any set of N points in the plane and let DT(S) be the graph of the Delaunay triangulation of S. For all points a and b of S, let d(a, b) be the Euclidean distance from a to b and let DT(a, b) be the length of the shortest path in DT(S) from a to b. We show that there is a constant c(≤ 1+√5/2 π ≈ 5.08) independent of S and N such that DT(a, b)/d(a, b)