Improving Shortest Paths in the Delaunay Triangulation

We study a problem about shortest paths in Delaunay triangulations. Given two nodes s, t in the Delaunay triangulation of a point set S, we look for a new point p ∉ S that can be added, such that the shortest path from s to t, in the Delaunay triangulation of S∪{p}, improves as much as possible. We study several properties of the problem, and give efficient algorithms to find such a point when the graph-distance used is Euclidean and for the link-distance. Several other variations of the problem are also discussed.

[1]  Alexander Wolff,et al.  Augmenting the Connectivity of Planar and Geometric Graphs , 2012, J. Graph Algorithms Appl..

[2]  Jörg Liebeherr,et al.  Application-layer multicasting with Delaunay triangulation overlays , 2002, IEEE J. Sel. Areas Commun..

[3]  Csaba D. Tóth.  Connectivity augmentation in plane straight line graphs , 2008, Electron. Notes Discret. Math..

[4]  Joachim Gudmundsson,et al.  Improving the Stretch Factor of a Geometric Network by Edge Augmentation , 2008, SIAM J. Comput..

[5]  Ki-Joune Li,et al.  P2P Spatial Query Processing by Delaunay Triangulation , 2004, W2GIS.

[6]  Marc Noy,et al.  Augmenting the Connectivity of Outerplanar Graphs , 2008, Algorithmica.

[7]  Ivan J. Balaban,et al.  An optimal algorithm for finding segments intersections , 1995, SCG '95.

[8]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[9]  Maha Abdallah,et al.  Efficient triangulation for P2P networked virtual environments , 2008, Multimedia Tools and Applications.

[10]  David P. Dobkin,et al.  Delaunay graphs are almost as good as complete graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[11]  Jun Luo,et al.  Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces , 2008, ISAAC.

[12]  Steven Fortune,et al.  A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.

[13]  Thomas Ottmann,et al.  Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.

[14]  Clyde L. Monma,et al.  Transitions in geometric minimum spanning trees , 1991, SCG '91.

[15]  Prosenjit Bose,et al.  Online Routing in Triangulations , 1999, SIAM J. Comput..

[16]  Maarten Löffler,et al.  Almost all Delaunay triangulations have stretch factor greater than pi/2 , 2011, Comput. Geom..

[17]  Ge Xia.  Improved upper bound on the stretch factor of delaunay triangulations , 2011, SoCG '11.