Improving shortest paths in the Delaunay triangulation
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10190900" target="_blank" >RIV/00216208:11320/12:10190900 - isvavai.cz</a>
Result on the web
<a href="http://www.worldscientific.com/doi/abs/10.1142/S0218195912500161" target="_blank" >http://www.worldscientific.com/doi/abs/10.1142/S0218195912500161</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1142/S0218195912500161" target="_blank" >10.1142/S0218195912500161</a>
Alternative languages
Result language
angličtina
Original language name
Improving shortest paths in the Delaunay triangulation
Original language description
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 (not in S) that can be added, such that the shortest path from s to t, in the Delaunay triangulation of S UNION {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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GEGIG%2F11%2FE023" target="_blank" >GEGIG/11/E023: Graph Drawings and Representations</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
International Journal of Computational Geometry and Applications
ISSN
0218-1959
e-ISSN
—
Volume of the periodical
22
Issue of the periodical within the volume
6
Country of publishing house
GB - UNITED KINGDOM
Number of pages
18
Pages from-to
559-576
UT code for WoS article
000317142700004
EID of the result in the Scopus database
—