Adjacency-preserving spatial treemaps

Authors:
Kevin Buchin;David Eppstein;Maarten Löffler;Martin Nöllenburg;Rodrigo I. Silveira
Affiliations:
Dept. of Mathematics and Computer Science, TU Eindhoven;Dept. of Computer Science, University of California, Irvine;Dept. of Computer Science, University of California, Irvine;Institute of Theoretical Informatics, Karlsruhe Institute of Technology;Dept. de Matemática Aplicada II, Universitat Politècnica de Catalunya
Venue:
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Year:
2011

Citing 11
Cited 0

Tree visualization with tree-maps: 2-d space-filling approach

ACM Transactions on Graphics (TOG)
Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems

Theoretical Computer Science
Two Algorithms for Finding Rectangular Duals of Planar Graphs

WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
RecMap: Rectangular Map Approximations

INFOVIS '04 Proceedings of the IEEE Symposium on Information Visualization
On rectangular cartograms

Computational Geometry: Theory and Applications
Visual Analysis of Network Traffic for Resource Planning, Interactive Monitoring, and Interpretation of Security Threats

IEEE Transactions on Visualization and Computer Graphics
Spatially Ordered Treemaps

IEEE Transactions on Visualization and Computer Graphics
Area-universal rectangular layouts

Proceedings of the twenty-fifth annual symposium on Computational geometry
Orientation-Constrained Rectangular Layouts

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Configuring Hierarchical Layouts to Address Research Questions

IEEE Transactions on Visualization and Computer Graphics
Optimizing regular edge labelings

GD'10 Proceedings of the 18th international conference on Graph drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rectangular layouts, subdivisions of an outer rectangle into smaller rectangles, have many applications in visualizing spatial information, for instance in rectangular cartograms in which the rectangles represent geographic or political regions. A spatial treemap is a rectangular layout with a hierarchical structure: the outer rectangle is subdivided into rectangles that are in turn subdivided into smaller rectangles. We describe algorithms for transforming a rectangular layout that does not have this hierarchical structure, together with a clustering of the rectangles of the layout, into a spatial treemap that respects the clustering and also respects to the extent possible the adjacencies of the input layout.