Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/7131
Nаziv: | Linear time algorithm for optimal feed-link placement | Аutоri: | Savić, Mirko Stojaković, Mila |
Dаtum izdаvаnjа: | 1-јан-2015 | Čаsоpis: | Computational Geometry: Theory and Applications | Sažetak: | © 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 |
Nаlаzi sе u kоlеkciјаmа: | FTN Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
2
prоvеrеnо 20.11.2023.
Prеglеd/i stаnicа
9
Prоtеklа nеdеljа
7
7
Prоtеkli mеsеc
1
1
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.