Adjacency-preserving spatial treemaps

DOI10.1007/978-3-642-22300-6_14zbMATH Open1342.68330OpenAlexW1930118087MaRDI QIDQ5199239FDOQ5199239

David Eppstein, Maarten Löffler, Rodrigo I. Silveira, Kevin Buchin, Martin Nöllenburg

Publication date: 12 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/101755

Recommendations

• Adjacency-preserving spatial treemaps
• Treemaps with bounded aspect ratio
• Circular partitions with applications to visualization and embeddings
• Treemaps with bounded aspect ratio
• Area-universal and constrained rectangular layouts

Mathematics Subject Classification ID

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

Cited In (4)

• Treemaps for Directed Acyclic Graphs
• Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach
• The Parametric Closure Problem
• Spatial CART classification trees

This page was built for publication: Adjacency-preserving spatial treemaps

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