Adjacency-preserving spatial treemaps

K. Buchin, D. Eppstein, M. Löffler, M. Nöllenburg, R.I. Silveira

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

15 Citaten (Scopus)

Samenvatting

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.
Originele taal-2Engels
TitelAlgorithms and Data Structures (12th International Workshop, WADS 2011, Brooklyn NY, USA, August 15-17, 2011. Proceedings)
RedacteurenF. Dehne, J. Iacono, J.R. Sack
Plaats van productieBerlin
UitgeverijSpringer
Pagina's159-170
ISBN van geprinte versie978-3-642-22299-3
DOI's
StatusGepubliceerd - 2011

Publicatie series

NaamLecture Notes in Computer Science
Volume6844
ISSN van geprinte versie0302-9743

Citeer dit