IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION

MANUEL ABELLANAS, MERCÈ CLAVEROL, GREGORIO HERNÁNDEZ, FERRAN HURTADO, VERA SACRISTÁN, MARIA SAUMELL, RODRIGO I. SILVEIRA
2012 International journal of computational geometry and applications  
2 M. Abellanas et al. 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
more » ... tance. Several other variations of the problem are also discussed.
doi:10.1142/s0218195912500161 fatcat:4x3o6tsb4jh7dgktdevhfvgydq