Transitions in Dynamic Point Labeling
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912930225717248 |
|---|---|
| author | Depian, Thomas Li, Guangping Nöllenburg, Martin Wulms, Jules |
| author_facet | Depian, Thomas Li, Guangping Nöllenburg, Martin Wulms, Jules |
| contents | 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) upper 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, we consider geotagged data on a map, by labeling points with rectangular or square labels. We developed a prototype implementation to evaluate different transition styles in practice, measuring both number of overlaps and transition duration. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2202_11562 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Transitions in Dynamic Point Labeling Depian, Thomas Li, Guangping Nöllenburg, Martin Wulms, Jules Computational Geometry Computational Complexity F.1.3; I.3.5 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) upper 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, we consider geotagged data on a map, by labeling points with rectangular or square labels. We developed a prototype implementation to evaluate different transition styles in practice, measuring both number of overlaps and transition duration. |
| title | Transitions in Dynamic Point Labeling |
| topic | Computational Geometry Computational Complexity F.1.3; I.3.5 |
| url | https://arxiv.org/abs/2202.11562 |