Computing stable Demers cartograms

DOI10.1007/978-3-030-35802-0_4OpenAlexW2989723024MaRDI QIDQ2206829

Wouter Meulemans, Markus Chimani, Soeren Nickel, Martin Nöllenburg, Stephen G. Kobourov, Max Sondag, Jaakko Peltonen

Publication date: 26 October 2020

Full work available at URL: https://arxiv.org/abs/1908.07291

zbMATH Keywords

cartogramstime-varying datamental-map preservation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Node Overlap Removal Algorithms: an Extended Comparative Study

Cites Work

• On rectangular cartograms
• Unit disk graph recognition is NP-hard
• Recognizing Weighted Disk Contact Graphs
• Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees
• Improved Grid Map Layout by Point Set Matching
• Area-universal rectangular layouts
• Diffusion-based method for producing density-equalizing maps
• Computing cartograms with optimal complexity
• Contact graphs of line segments are NP-complete