Dynamic point labeling is strongly PSPACE-hard

K. Buchin, D.H.P. Gerrits

Research output: Contribution to journalArticleAcademicpeer-review

7 Citations (Scopus)
1 Downloads (Pure)

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. Keywords: Dynamic label placement; complexity analysis; PSPACE-hardness
Original languageEnglish
Pages (from-to)373-395
JournalInternational Journal of Computational Geometry and Applications
Volume24
Issue number4
DOIs
Publication statusPublished - 2014

Fingerprint Dive into the research topics of 'Dynamic point labeling is strongly PSPACE-hard'. Together they form a unique fingerprint.

  • Cite this