@inproceedings{17d9a39e689c425586ff2ce7c70ecb4b,

title = "Connect the dot: Computing feed-links with minimum dilation",

abstract = "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 of dilation 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 (a,{\ss})-covered polygons, a constant number of feed-links suffices to realize constant dilation.",

author = "B. Aronov and K. Buchin and M. Buchin and {Kreveld, van}, M.J. and M. L{\"o}ffler and J. Luo and R.I. Silveira and B. Speckmann",

year = "2009",

doi = "10.1007/978-3-642-03367-4_5",

language = "English",

isbn = "978-3-642-03366-7",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "49--60",

editor = "F. Dehne and M. Gavrilova and J.-R. Sack and C.D. T{\'o}th",

booktitle = "Algorithms and Data Structures (Proceedings 11th International Workshop, WADS 2009, Banff, Alberta, Canada, August 21-23, 2009)",

address = "Germany",

}