Adjacency-preserving spatial treemaps

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 hiera...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computational geometry Vol. 7; no. 1
Main Authors:	Buchin, Kevin, Eppstein, David, Löffler, Maarten, Nöllenburg, Martin, Silveira, Rodrigo Ignacio
Format:	Publication Journal Article
Language:	English
Published:	Carleton University 01.01.2016
Subjects:	68 Computer science 68U Computing methodologies and applications Classificació AMS Computing Methodologies Informàtica teòrica Matemàtica aplicada a les ciències Matemàtiques i estadística Àrees temàtiques de la UPC
ISSN:	1920-180X, 1920-180X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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. Peer Reviewed
ISSN:	1920-180X 1920-180X
DOI:	10.20382/jocg.v7i1a6