Affiliation:
1. Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Den Dolech 2, 5600 MB Eindhoven, The Netherlands
Abstract
An important but strongly NP-hard problem in automated cartography is how to best place textual labels for point features on a static map. We examine the complexity of various generalizations of this problem for dynamic and/or interactive maps. Specifically, we show that it is strongly PSPACE-complete to decide whether there is a smooth dynamic labeling (function from time to static labelings) when the points move, when points are added and removed, or when the user pans, rotates, and/or zooms their view of the points. In doing so we develop a framework from which a wide variety of labeling hardness results can be obtained, including (next to the PSPACE-hardness results) both known and new results on the NP-hardness of static labeling.
Publisher
World Scientific Pub Co Pte Lt
Subject
Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Minimum point-overlap labelling*;Optimization Methods and Software;2020-10-30
2. A Unified Model and Algorithms for Temporal Map Labeling;Algorithmica;2020-04-07
3. Minimum Point-Overlap Labeling;Lecture Notes in Computer Science;2017
4. Evaluation of Labeling Strategies for Rotating Maps;ACM Journal of Experimental Algorithmics;2016-11-04
5. Temporal map labeling;Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems;2016-10-31