Abstract: Road network analysis can require distance from points that are not on the network themselves. We study the algorithmic problem of connecting a point inside a face (region) of the road network to its boundary while minimizing the detour factor of that point to any point on the boundary of the face. We show that the optimal single connection (feed-link) can be computed in O(λ 7 (n) log n) time, where n is the number of vertices that bounds the face and λ 7 (n) is the slightly superlinear maximum length of a DavenportSchinzel sequence of order 7 on n symbols. We also present approximation results for placing more feed-links, deal with the case that there are obstacles in the face of the road network that contains the point to be connected, and present various related results.
Aronov et al. REF present algorithms for the following problem: given a point inside a polygon, compute a segment from the point to the boundary of the polygon such that the dilation from the given point to any point on the boundary is minimized.
Connect the dot: Computing feed-links for network extension ∗
J. Spatial Information Science
J. Spatial Information Science
Psychology Computer Science