边巡逻信标问题的一个反例
Negative Instance for the Edge Patrolling Beacon Problem
摘要：
一个无限强的磁信标总是“抓住”一个铁球，当信标是一个点，需要保持非严格的多边形外，和球是一个点，总是瞬间和最大限度地向信标受非严格保持在同一个多边形？Kouhestani和Rappaport [JCDCG 2017]给出了一种算法，用于确定是否存在接球信标策略，同时证明这种策略始终存在。我们反驳这一猜想，通过构建正交和一般位置多边形中的球和信标永远不能统一。
英文摘要：
Can an infinite-strength magnetic beacon always ``catch'' an iron ball, when the beacon is a point required to be remain nonstrictly outside a polygon, and the ball is a point always moving instantaneously and maximally toward the beacon subject to staying nonstrictly within the same polygon? Kouhestani and Rappaport [JCDCG 2017] gave an algorithm for determining whether a ball-capturing beacon strategy exists, while conjecturing that such a strategy always exists. We disprove this conjecture by constructing orthogonal and general-position polygons in which the ball and the beacon can never be united.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
