Computing stable Demers cartograms

DOI10.1007/978-3-030-35802-0_4MaRDI QIDQ2206829zbMATH OpenOpenAlexFDO

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

Publication date 26 October 2020

Full work available at URL https://arxiv.org/abs/1908.07291, https://trepo.tuni.fi/handle/10024/120353

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)

Recommendations

• Computing cartograms with optimal complexity
• Computing cartograms with optimal complexity
• A combinatorial approach to cartograms.
• The computation of megamaps

Cites work

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

Cited in

(2)

• scientific article; zbMATH DE number 1306283 (Why is no real title available?)
• Node overlap removal algorithms: an extended comparative study

This page was built for publication: Computing stable Demers cartograms

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