arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1612.03540math.GNmath.DS
收藏

平面域的扫掠代价

Sweeping costs of planar domains

Brooks Adams, Henry Adams, Colin Roberts

摘要:

设D是平面上的Jordan域.我们考虑一个追求逃避,污染清除,或传感器扫描问题,其中的追求者在每个时间点是由一个连续的曲线,称为传感器曲线建模。时间和空间都是连续的,入侵者对追踪者来说是无形的。给定D,提供扫描域D所需的传感器曲线的最短长度是多少,使得在D中没有连续移动的入侵者可以避免被曲线击中?我们将这个长度定义为D的清扫成本。我们提供了一个解析公式的扫描成本的任何约旦域的两条曲线之间的测地Frechet距离的边界上的D与非相等的卷绕数。结果表明,任何凸区域的扫描代价等于其宽度,且具有最大扫描代价的单位面积凸区域是等边三角形。

英文摘要:

Let D be a Jordan domain in the plane. We consider a pursuit-evasion, contamination clearing, or sensor sweep problem in which the pursuer at each point in time is modeled by a continuous curve, called the sensor curve. Both time and space are continuous, and the intruders are invisible to the pursuer. Given D, what is the shortest length of a sensor curve necessary to provide a sweep of domain D, so that no continuously-moving intruder in D can avoid being hit by the curve? We define this length to be the sweeping cost of D. We provide an analytic formula for the sweeping cost of any Jordan domain in terms of the geodesic Frechet distance between two curves on the boundary of D with non-equal winding numbers. As a consequence, we show that the sweeping cost of any convex domain is equal to its width, and that a convex domain of unit area with maximal sweeping cost is the equilateral triangle.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑