Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Adjacency-Preserving Spatial Treemaps (1105.0398v1)

Published 2 May 2011 in cs.CG

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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Kevin Buchin (55 papers)
  2. David Eppstein (228 papers)
  3. Maarten Löffler (80 papers)
  4. Martin Nöllenburg (98 papers)
  5. Rodrigo I. Silveira (32 papers)
Citations (23)

Summary

We haven't generated a summary for this paper yet.