arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2301.04350cs.CG
收藏

最大中心不相含可合并圆盘

Maximum Centre-Disjoint Mergeable Disks

Babol Noshirvani University of Technology(巴博尔·诺什里瓦尼理工大学)

Ali Gholami Rudi

AI总结:

本文研究在平面中选择一组圆盘,使其中心互不包含,并允许合并其他圆盘以扩大半径。证明该问题为NP难,并提出整数线性规划模型及线性排列情况下的多项式算法。

摘要:

给定平面中的圆盘集合,本文研究选择子集使其中任意圆盘不包含其他圆盘的中心。未选中的圆盘需与邻近圆盘合并以扩大半径。该问题应用于旋转地图标注和静态地图实体分布可视化。证明该问题为NP难,并提出整数线性规划模型及所有圆心共线的特殊情形下的多项式算法。

英文摘要:

Given a set of disks in the plane, the goal of the problem studied in this paper is to choose a subset of these disks such that none of its members contains the centre of any other. Each disk not in this subset must be merged with one of its nearby disks that is, increasing the latter's radius. This problem has applications in labelling rotating maps and in visualizing the distribution of entities in static maps. We prove that this problem is NP-hard. We also present an ILP formulation for this problem, and a polynomial-time algorithm for the special case in which the centres of all disks are on a line.

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

↑