Improving shortest paths in the Delaunay triangulation

View/Open
Cita com:
hdl:2117/16981
Document typeArticle
Defense date2012
Rights accessOpen Access
This work is protected by the corresponding intellectual and industrial property rights.
Except where otherwise noted, its contents are licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain
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.
CitationAbellanas, M. [et al.]. Improving shortest paths in the Delaunay triangulation. "International journal of computational geometry and applications", 2012.
ISSN0218-1959
Files | Description | Size | Format | View |
---|---|---|---|---|
delaunay_triangulation.pdf | 708,4Kb | View/Open |