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 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 u{p} improves as much as possible. We study 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 |
Nombre congreso
|
XIV Spanish Meeting on Computacional Geometry, EGC2011 |
Tipo de participación
|
960 |
Lugar del congreso
|
Alcalá de Henares, Madrid |
Revisores
|
Si |
ISBN o ISSN
|
2014-2323 |
DOI
|
|
Fecha inicio congreso
|
27/06/2011 |
Fecha fin congreso
|
30/06/2011 |
Desde la página
|
117 |
Hasta la página
|
120 |
Título de las actas
|
Proc. of XIV Spanish Meeting on Computacional Geometry, |