|
E-prints UPC >
Altres >
Enviament des de DRAC >
Empreu aquest identificador per citar o enllaçar aquest ítem:
http://hdl.handle.net/2117/16981
|
| Citació: | Abellanas, M. [et al.]. Improving shortest paths in the Delaunay triangulation. "International journal of computational geometry and applications", 2012. |
| Títol: | Improving shortest paths in the Delaunay triangulation |
| Autor: | Abellanas, Manuel; Claverol Aguas, Mercè  ; Hernández-Peñalver, Gregorio; Hurtado Díaz, Fernando Alfredo ; Sacristán Adinolfi, Vera ; Saumell Mendiola, Maria ; Silveira, Rodrigo Ignacio |
| Data: | 2012 |
| Tipus de document: | Article |
| Resum: | We study a problem about shortest paths in Delaunay triangulations. Given two nodes s, t in the Delaunay triangulation of a point set P, we look for a new point p that can be added, such that the shortest path from s to t, in the Delaunay triangulation of P ∪ {p}, improves as much as possible. We study
several properties of the problem, and give efficient algorithms to find such point when the graph-distance used is Euclidean and for the link-distance. Several other variations of the problem are also discussed. |
| ISSN: | 0218-1959 |
| URI: | http://hdl.handle.net/2117/16981 |
| Apareix a les col·leccions: | Departaments de Matemàtica Aplicada. Articles de revista
DCCG - Grup de recerca en geometria computacional, combinatoria i discreta. Articles de revista
Altres. Enviament des de DRAC
|
| Comparteix: |
|
Aquest ítem (excepte textos i imatges no creats per l'autor) està subjecte a una llicència de Creative Commons Llicència Creative Commons
|
Català
Castellano
English
