一种求逆信标吸引域的优化算法
An Optimal Algorithm to Compute the Inverse Beacon Attraction Region
摘要:
信标模型是最近的范例,用于在复杂环境中引导消息或小型机器人代理的轨迹。信标是一个具有吸引力的固定点,可以在给定的多边形内移动点。点向信标方向移动:如果没有障碍,它们沿着直线移动到信标,否则它们在多边形的边缘上滑动。从移动点到信标的欧几里德距离是单调递减的。一个给定的信标吸引一个点,如果该点最终到达信标。用一组信标吸引多边形内的所有点的问题可以被视为美术馆问题的变体。与大多数变化不同,信标吸引力具有不对称的有趣特性,导致吸引力区域和逆吸引力区域的单独定义。信标的吸引区域是它所吸引的点的集合。它是连通的,对于简单多边形可以在线性时间内计算。相比之下,已知一个点的反向吸引区域--吸引它的信标位置的集合--可以具有$Ω(n)$不相交的连通分量。本文证明了尽管如此,简单多边形中点的反吸引域的总复杂度仍是线性的,并给出了构造它的一个$O(n \log n)$时间算法,改进了以往的最佳算法,即需要$O(n^3)$时间和$O(n^2)$空间.此外,我们证明了一个匹配的$Ω(n\log n)$下界为这个任务的代数计算树模型的计算,即使多边形是单调的。
英文摘要:
The beacon model is a recent paradigm for guiding the trajectory of messages or small robotic agents in complex environments. A beacon is a fixed point with an attraction pull that can move points within a given polygon. Points move greedily towards a beacon: if unobstructed, they move along a straight line to the beacon, and otherwise they slide on the edges of the polygon. The Euclidean distance from a moving point to a beacon is monotonically decreasing. A given beacon attracts a point if the point eventually reaches the beacon. The problem of attracting all points within a polygon with a set of beacons can be viewed as a variation of the art gallery problem. Unlike most variations, the beacon attraction has the intriguing property of being asymmetric, leading to separate definitions of attraction region and inverse attraction region. The attraction region of a beacon is the set of points that it attracts. It is connected and can be computed in linear time for simple polygons. By contrast, it is known that the inverse attraction region of a point---the set of beacon positions that attract it---could have $Ω(n)$ disjoint connected components. In this paper, we prove that, in spite of this, the total complexity of the inverse attraction region of a point in a simple polygon is linear, and present a $O(n \log n)$ time algorithm to construct it. This improves upon the best previous algorithm which required $O(n^3)$ time and $O(n^2)$ space. Furthermore we prove a matching $Ω(n\log n)$ lower bound for this task in the algebraic computation tree model of computation, even if the polygon is monotone.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。