par Abellanas, Manuel;Claverol, Mercè;Hernández, Gregorio;Hurtado, Ferran 
;Sacristán, Vera;Saumell Mendiola, Maria ;Silveira, Rodrigo R.I.
Référence International journal of Computational geometry and applications, 22, 6, page (559-576)
Publication Publié, 2012-12
;Sacristán, Vera;Saumell Mendiola, Maria ;Silveira, Rodrigo R.I.Référence International journal of Computational geometry and applications, 22, 6, page (559-576)
Publication Publié, 2012-12
Article révisé par les pairs
| Résumé : | 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 Element; 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. © 2012 World Scientific Publishing Company. |
