<div class="csl-bib-body">
<div class="csl-entry">Depian, T., Li, G., Nöllenburg, M., & Wulms, J. (2023). Transitions in Dynamic Point Labeling. In <i>12th International Conference on Geographic Information Science (GIScience 2023)</i>. 12th International Conference on Geographic Information Science (GIScience 2023), United Kingdom of Great Britain and Northern Ireland (the). Schloss-Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.GIScience.2023.2</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/190046
-
dc.description.abstract
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.
en
dc.description.sponsorship
FWF - Österr. Wissenschaftsfonds
-
dc.description.sponsorship
WWTF Wiener Wissenschafts-, Forschu und Technologiefonds
-
dc.language.iso
en
-
dc.relation.ispartofseries
Leibniz International Proceedings in Informatics
-
dc.relation.hasversion
https://doi.org/10.48550/arXiv.2202.11562
-
dc.rights.uri
http://creativecommons.org/licenses/by/4.0/
-
dc.subject
Case study
en
dc.subject
Dynamic labels
en
dc.subject
Label overlaps
en
dc.subject
Morphs
en
dc.subject
NP-completeness
en
dc.title
Transitions in Dynamic Point Labeling
en
dc.type
Inproceedings
en
dc.type
Konferenzbeitrag
de
dc.rights.license
Creative Commons Namensnennung 4.0 International
de
dc.rights.license
Creative Commons Attribution 4.0 International
en
dc.relation.isbn
978-3-95977-288-4
-
dc.relation.doi
10.4230/LIPIcs.GIScience.2023
-
dc.relation.issn
1868-8969
-
dc.relation.grantno
P31119-N31
-
dc.relation.grantno
ICT19-035
-
dcterms.dateSubmitted
2023
-
dc.rights.holder
Thomas Depian, Guangping Li, Martin Nöllenburg, and Jules Wulms;
-
dc.type.category
Full-Paper Contribution
-
tuw.booktitle
12th International Conference on Geographic Information Science (GIScience 2023)
-
tuw.container.volume
277
-
tuw.peerreviewed
true
-
tuw.book.ispartofseries
Leibniz International Proceedings in Informatics
-
tuw.relation.publisher
Schloss-Dagstuhl - Leibniz Zentrum für Informatik
-
tuw.book.chapter
2
-
tuw.project.title
Human-Centered Algorithm Engineering
-
tuw.project.title
Engineering Linear Ordering Algorithms for Optimizing Data Visualizations
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E192-01 - Forschungsbereich Algorithms and Complexity
-
tuw.publisher.doi
10.4230/LIPIcs.GIScience.2023.2
-
dc.identifier.libraryid
AC17202023
-
dc.description.numberOfPages
19
-
tuw.author.orcid
0000-0003-0454-3937
-
dc.rights.identifier
CC BY 4.0
de
dc.rights.identifier
CC BY 4.0
en
tuw.event.name
12th International Conference on Geographic Information Science (GIScience 2023)
en
tuw.event.startdate
12-09-2023
-
tuw.event.enddate
15-09-2023
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.country
GB
-
tuw.event.presenter
Depian, Thomas
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
80
-
wb.sciencebranch.value
20
-
item.languageiso639-1
en
-
item.openairetype
conference paper
-
item.grantfulltext
open
-
item.fulltext
with Fulltext
-
item.cerifentitytype
Publications
-
item.mimetype
application/pdf
-
item.openairecristype
http://purl.org/coar/resource_type/c_5794
-
item.openaccessfulltext
Open Access
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity
-
crisitem.author.dept
E192-02 - Forschungsbereich Databases and Artificial Intelligence
-
crisitem.author.orcid
0009-0003-7498-6271
-
crisitem.author.orcid
0000-0003-0454-3937
-
crisitem.author.parentorg
E192 - Institut für Logic and Computation
-
crisitem.author.parentorg
E192 - Institut für Logic and Computation
-
crisitem.author.parentorg
E192 - Institut für Logic and Computation
-
crisitem.author.parentorg
E192 - Institut für Logic and Computation
-
crisitem.project.funder
FWF - Österr. Wissenschaftsfonds
-
crisitem.project.funder
WWTF Wiener Wissenschafts-, Forschu und Technologiefonds