Dynamic point labeling is strongly PSPACE-complete

DOI10.1142/S0218195914600127MaRDI QIDQ5261020zbMATH OpenOpenAlexFDO

Authors Kevin Buchin, Dirk H. P. Gerrits

Publication date 1 July 2015

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195914600127

zbMATH Keywords

complexity analysisdynamic label placementPSPACE-hardness

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Dynamic Point Labeling is Strongly PSPACE-Complete
• Trajectory-based dynamic map labeling
• Optimizing active ranges for consistent dynamic map labeling
• Three rules suffice for good label placement
• Consistent labeling of rotating maps

Cites work

• A better heuristic for orthogonal graph drawings
• Optimizing active ranges for consistent dynamic map labeling
• Point labeling with sliding labels
• PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
• Relationships between nondeterministic and deterministic tape complexities

Cited in

(6)

• A unified model and algorithms for temporal map labeling
• Dynamic Point Labeling is Strongly PSPACE-Complete
• Trajectory-based dynamic map labeling
• Minimum point-overlap labelling*
• Evaluation of labeling strategies for rotating maps
• Minimum point-overlap labeling

This page was built for publication: Dynamic point labeling is strongly PSPACE-complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261020)