Connect the dot: Computing feed-links with minimum dilation
文献类型：会议论文
| 作者 | Boris Aronov; Kevin Buchin; Maike Buchin; Marc van Kreveld; Maarten L¨offler; Jun Luo; Rodrigo I. Silveira; Bettina Speckmann |
| 出版日期 | 2009 |
| 会议名称 | 11th International Symposium on Algorithms and Data Structures, WADS 2009 |
| 英文摘要 | A feed-link is an artificial connection from a given location p to a real-world network. It is most commonly added to an incomplete network to improve the results of network analysis, by making p part of the network. The feed-link has to be "reasonable", hence we use the concept ofdilation to determine the quality of a connection. We consider the following abstract problem: Given a simple polygon P with n vertices and a point p inside, determine a point q on P such that adding a feedlink minimizes the maximum dilation of any point on P. Here the dilation of a point r on P is the ratio of the shortest route from r over P and to p, to the Euclidean distance from r to p. We solve this problem in O(λ 7(n)logn) time, where λ7(n) is the slightly superlinear maximum length of a Davenport-Schinzel sequence of order 7. We also show that for convex polygons, two feed-links are always sufficient and sometimes necessary to realize constant dilation, and that k feed-links lead to a dilation of 1 + O(1/k). For (α,β)-covered polygons, a constant number of feed-links suffices to realize constant dilation. |
| 收录类别 | EI |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/2665]  |
| 专题 | 深圳先进技术研究院_数字所 |
| 作者单位 | 2009 |
| 推荐引用方式 GB/T 7714 | Boris Aronov,Kevin Buchin,Maike Buchin,et al. Connect the dot: Computing feed-links with minimum dilation[C]. 见:11th International Symposium on Algorithms and Data Structures, WADS 2009. |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。