Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/7131
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Savić, Mirko | en |
dc.contributor.author | Stojaković, Mila | en |
dc.date.accessioned | 2019-09-30T08:59:47Z | - |
dc.date.available | 2019-09-30T08:59:47Z | - |
dc.date.issued | 2015-01-01 | en |
dc.identifier.issn | 09257721 | en |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/7131 | - |
dc.description.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). | en |
dc.relation.ispartof | Computational Geometry: Theory and Applications | en |
dc.title | Linear time algorithm for optimal feed-link placement | en |
dc.type | Journal/Magazine Article | en |
dc.identifier.doi | 10.1016/j.comgeo.2014.09.006 | en |
dc.identifier.scopus | 2-s2.0-84908205530 | en |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/84908205530 | en |
dc.relation.lastpage | 204 | en |
dc.relation.firstpage | 189 | en |
dc.relation.issue | 3 | en |
dc.relation.volume | 48 | en |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
Appears in Collections: | FTN Publikacije/Publications |
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.