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

旋转映射的一致标号

Consistent Labeling of Rotating Maps

Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter

摘要:

允许连续地图旋转的动态地图,例如,在移动设备上,遇到以前在静态地图标注中看不到的新问题。我们研究了以下动态地图标注问题:输入是一个静态的,标记的地图,即,平面中的点的集合P,其具有附加的不重叠的水平矩形标签。我们的目标是找到一个一致的标记下旋转的P,最大限度地为所有旋转角度的可见标签的数量,使标签保持水平,而地图旋转。如果为每个标签选择单个活动角度区间,使得标签在任何旋转角度下都不会彼此相交或遮挡P中的点,则标签是一致的。我们首先介绍了一个一般的模型标记旋转映射和推导出的基本几何性质的一致性的解决方案。我们显示NP-完全的活动区间最大化问题,即使单位平方标签。然后,我们提出了一个常数因子近似这个问题的基础上线刺,并进一步完善成一个有效的多项式时间近似方案(EPTAS)。最后,我们将EPTAS扩展到更一般的设置矩形标签的有界大小和纵横比。

英文摘要:

Dynamic maps that allow continuous map rotations, e.g., on mobile devices, encounter new issues unseen in static map labeling before. We study the following dynamic map labeling problem: The input is a static, labeled map, i.e., a set P of points in the plane with attached non-overlapping horizontal rectangular labels. The goal is to find a consistent labeling of P under rotation that maximizes the number of visible labels for all rotation angles such that the labels remain horizontal while the map is rotated. A labeling is consistent if a single active interval of angles is selected for each label such that labels neither intersect each other nor occlude points in P at any rotation angle. We first introduce a general model for labeling rotating maps and derive basic geometric properties of consistent solutions. We show NP-completeness of the active interval maximization problem even for unit-square labels. We then present a constant-factor approximation for this problem based on line stabbing, and refine it further into an efficient polynomial-time approximation scheme (EPTAS). Finally, we extend the EPTAS to the more general setting of rectangular labels of bounded size and aspect ratio.

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

↑