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.
|Title of host publication||Algorithms and Data Structures (12th International Workshop, WADS 2011, Brooklyn NY, USA, August 15-17, 2011. Proceedings)|
|Editors||F. Dehne, J. Iacono, J.R. Sack|
|Place of Publication||Berlin|
|Publication status||Published - 2011|
|Name||Lecture Notes in Computer Science|
Buchin, K., Eppstein, D., Löffler, M., Nöllenburg, M., & Silveira, R. I. (2011). Adjacency-preserving spatial treemaps. In F. Dehne, J. Iacono, & J. R. Sack (Eds.), Algorithms and Data Structures (12th International Workshop, WADS 2011, Brooklyn NY, USA, August 15-17, 2011. Proceedings) (pp. 159-170). (Lecture Notes in Computer Science; Vol. 6844). Springer. https://doi.org/10.1007/978-3-642-22300-6_14