Dynamic point labeling is strongly PSPACE-hard

K. Buchin, D.H.P. Gerrits

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

46 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-hard to obtain 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.
Original languageEnglish
Title of host publication29th European Workshop on Computational Geometry (EuroCG 2013, Braunschweig, Germany, March 17-20, 2013)
Pages241-244
Publication statusPublished - 2013

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

  • Cite this

    Buchin, K., & Gerrits, D. H. P. (2013). Dynamic point labeling is strongly PSPACE-hard. In 29th European Workshop on Computational Geometry (EuroCG 2013, Braunschweig, Germany, March 17-20, 2013) (pp. 241-244)