|
Descripción
|
|
|---|---|
| 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. | |
|
Internacional
|
Si |
|
JCR del ISI
|
Si |
|
Título de la revista
|
International Journal of Computational Geometry and Applications |
|
ISSN
|
0218-1959 |
|
Factor de impacto JCR
|
0,292 |
|
Información de impacto
|
|
|
Volumen
|
22 |
|
DOI
|
dx.doi.org/10.1142/S0218195912500161 |
|
Número de revista
|
6 |
|
Desde la página
|
559 |
|
Hasta la página
|
576 |
|
Mes
|
SIN MES |
|
Ranking
|
|