Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/7131
Title: | Linear time algorithm for optimal feed-link placement | Authors: | Savić, Mirko Stojaković, Mila |
Issue Date: | 1-Jan-2015 | Journal: | Computational Geometry: Theory and Applications | Abstract: | © 2014 Elsevier B.V. Given a polygon representing a transportation network together with a point p in its interior, we aim to extend the network by inserting a line segment, called feed-link, which connects p to the boundary of the polygon. Once a feed link is fixed, the geometric dilation of some point q on the boundary is the ratio between the length of the shortest path from p to q through the extended network, and their Euclidean distance. The utility of a feed-link is inversely proportional to the maximal dilation over all boundary points. We give a linear time algorithm for computing the feed-link with the minimum overall dilation, thus improving upon the previously known algorithm of complexity that is roughly O(nlogn). | URI: | https://open.uns.ac.rs/handle/123456789/7131 | ISSN: | 09257721 | DOI: | 10.1016/j.comgeo.2014.09.006 |
Appears in Collections: | FTN Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
2
checked on Nov 20, 2023
Page view(s)
9
Last Week
7
7
Last month
1
1
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.