馈线最优配置的线性时间算法
Linear Time Algorithm for Optimal Feed-link Placement
摘要:
给定一个表示运输网络的多边形,其内部有一个点p,我们的目标是通过插入一条线段来扩展网络,该线段称为馈电链路,将p连接到多边形的边界。一旦固定了馈电链路,边界上某个点q的几何膨胀就是通过扩展网络从p到q的最短路径的长度与它们的欧几里得距离之比。馈电链路的效用与所有边界点上的最大膨胀成反比。我们给出了一个线性时间算法计算的最小的整体膨胀的馈电链路,从而改善了以前已知的算法的复杂性,大致是O(n log n)。
英文摘要:
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 a 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(n log n).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。