Молимо вас користите овај идентификатор за цитирање или овај линк до ове ставке:
https://open.uns.ac.rs/handle/123456789/7131
Назив: | Linear time algorithm for optimal feed-link placement | Аутори: | Savić, Mirko Stojaković, Mila |
Датум издавања: | 1-јан-2015 | Часопис: | Computational Geometry: Theory and Applications | Сажетак: | © 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 |
Налази се у колекцијама: | FTN Publikacije/Publications |
Приказати целокупан запис ставки
SCOPUSTM
Навођења
2
проверено 20.11.2023.
Преглед/и станица
9
Протекла недеља
7
7
Протекли месец
1
1
проверено 10.05.2024.
Google ScholarTM
Проверите
Алт метрика
Ставке на DSpace-у су заштићене ауторским правима, са свим правима задржаним, осим ако није другачије назначено.