发表机构
Department of Computer Science, University of Copenhagen（哥本哈根大学计算机系）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
针对ACM SIGSPATIAL GIS杯的天线布局问题，提出将几何可见性预处理与组合搜索结合，采用模拟退火等策略，在九个参数组合中覆盖261至16,273栋建筑，取得顶级成绩。
AI 中文摘要
2026年ACM SIGSPATIAL GIS杯提出了以下几何挑战：给定一组简单、两两不相交的多边形，在多边形边界上计算$k$个天线（点），最大化从天线可见周长至少为$\tau$比例的多边形数量。参赛者有24小时来产生最佳解决方案。我们描述了一种将几何可见性预处理与增量组合搜索组合分离的方法。一个构建池提供初始解决方案，其中天线限制在多边形顶点上；模拟退火探索一对一的天线交换，辅以精确的离散单交换下降、破坏与重建以及精英交叉。次要目标奖励朝向服务阈值的进展，而不覆盖主要分数。候选天线随后扩展为包括多边形边内部的点。我们提交的解决方案在九个参数组合中覆盖了261至16,273栋建筑，团队受邀作为顶级参赛作品之一进行展示。代码可在该https URL获取。
英文摘要
The 2026 ACM SIGSPATIAL GIS Cup posed the following geometric challenge: Given a set of simple, pair-wise disjoint polygons, compute $k$ antennas (points) on polygon boundaries, maximizing the number of polygons with at least a fraction $τ$ of their perimeter visible from the antennas. Contestants had 24 hours to produce the best possible solutions. We describe an approach that separates geometric visibility preprocessing from a portfolio of incremental combinatorial searches. A construction pool provides initial solutions with antennas restricted to polygon vertices; simulated annealing explores one-for-one antenna swaps, complemented by exact discrete one-swap descent, ruin-and-recreate, and elite crossover. A secondary objective rewards progress toward the service threshold without overriding the primary score. Candidate antennas are later expanded to include points in polygon-edge interiors. Our submitted solutions cover between 261 and 16,273 buildings across the nine parameter combinations, and the team was invited to present as one of the top entries. The code is available at https://github.com/JacobusTheSecond/giscup.
