Improving shortest paths in the Delaunay triangulation
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/16981
Tipus de documentArticle
Data publicació2012
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
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.
CitacióAbellanas, M. [et al.]. Improving shortest paths in the Delaunay triangulation. "International journal of computational geometry and applications", 2012.
ISSN0218-1959
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
delaunay_triangulation.pdf | 708,4Kb | Visualitza/Obre |