论文标题

动态点标记中的过渡

Transitions in Dynamic Point Labeling

论文作者

Depian, Thomas, Li, Guangping, Nöllenburg, Martin, Wulms, Jules

论文摘要

地图上的点功能的标签是一个充分的主题。在静态设置中,目标是为(一个子集的)特征找到一个非重叠的标签位置。在动态设置中,一组点特征及其相应的标签更改,标签必须适应此类更改。为了帮助用户跟踪这些更改,我们可以使用此处称为“过渡”的Morphs来指示标签如何变化。这些过渡尚未引起很多关注,我们研究了点标记的不同类型的过渡,最著名的是连续的过渡和同时过渡。我们在这些过渡过程中可能发生的重叠数量(紧密)界限。当每个标签具有与之相关的(非负重)重量时,并且每个重叠都与重叠标签的重量成正比施加惩罚时,我们表明,决定同时过渡期间的罚款是否最大为$ k $,这是NP的罚款。最后,在一个案例研究中,我们通过标记带有矩形标签的标签标签显示推文的标签点,考虑地图上的Twitter数据。我们开发了一个原型实现,以评估实践中不同的过渡风格,从而测量重叠数量和过渡持续时间的数量。

The labeling of point features on a map is a well-studied topic. In a static setting, the goal is to find a non-overlapping label placement for (a subset of) point features. In a dynamic setting, the set of point features and their corresponding labels change, and the labeling has to adapt to such changes. To aid the user in tracking these changes, we can use morphs, here called transitions, to indicate how a labeling changes. Such transitions have not gained much attention yet, and we investigate different types of transitions for labelings of points, most notably consecutive transitions and simultaneous transitions. We give (tight) bounds on the number of overlaps that can occur during these transitions. When each label has a (non-negative) weight associated to it, and each overlap imposes a penalty proportional to the weight of the overlapping labels, we show that it is NP-complete to decide whether the penalty during a simultaneous transition has weight at most $k$. Finally, in a case study, we consider geotagged Twitter data on a map, by labeling points with rectangular labels showing tweets. We developed a prototype implementation to evaluate different transition styles in practice, measuring both number of overlaps and transition duration.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源