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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of computational geometry Ročník 7; číslo 1
Hlavní autoři: Buchin, Kevin, Eppstein, David, Löffler, Maarten, Nöllenburg, Martin, Silveira, Rodrigo Ignacio
Médium: Publikace Journal Article
Jazyk:angličtina
Vydáno: Carleton University 01.01.2016
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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