Jump to content

Treemapping

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Gnubyexample (talk | contribs) at 13:48, 10 October 2009 (Added two open source GPL projects). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Visualization of a directory tree (showing the size of each folder including its subfolders) by means of a treemap in TreeSize.

Treemapping is a method for displaying tree-structured data by using nested rectangles.

Main idea

Treemaps display hierarchical (tree-structured) data as a set of nested rectangles. Each branch of the tree is given a rectangle, which is then tiled with smaller rectangles representing sub-branches. A leaf node's rectangle has an area proportional to a specified dimension on the data. (In the illustration, this is proportional to a waiting time). Often the leaf nodes are colored to show a separate dimension of the data.

When the color and size dimensions are correlated in some way with the tree structure, one can often easily see patterns that would be difficult to spot in other ways. A second advantage of treemaps is that, by construction, they make efficient use of space. As a result, they can legibly display thousands of items on the screen simultaneously.

The tiling algorithm

To create a treemap, one must define a tiling algorithm, that is, a way to divide a rectangle into sub-rectangles of specified areas. Ideally, a treemap algorithm would create rectangles of aspect ratio close to one, would furthermore preserve some sense of the ordering in the input data, and would change pari passu with the underlying data. Unfortunately, these properties have an inverse relationship. As the aspect ratio is optimized, the order of placement becomes less predictable. As the order becomes more stable, the aspect ratio is degraded.

To date, five primary rectangular treemap algorithms have been developed:

algorithm order aspect ratios stability
BinaryTree partially ordered high stable
Ordered partially ordered medium medium stability
Slice And Dice ordered very high stable
Squarified unordered lowest medium stability
Strip ordered medium medium stability

In addition, several algorithms have been proposed that use non-rectangular regions:

  • Voronoi Treemaps - based on voronoi diagram calculations
  • Jigsaw Treemaps - based on the geometry of space-filling curves

History

Area-based visualizations have existed for decades. Mosaic plots and Marimekko diagrams both use rectangular tilings to show joint distributions, for example. The main distinguishing feature of a treemap, however, is the recursive construction that allows it to be extended to hierarchical data with any number of levels. This idea was invented by University of Maryland, College Park professor Ben Shneiderman in the early 1990s. Shneiderman and his collaborators then deepened the idea by introducing a variety of interactive techniques for filtering and adjusting treemaps.

These early treemaps all used the simple "slice-and-dice" tiling algorithm. Despite many desired properties (it is stable, preserves ordering, and is easy to implement) the slice-and-dice method often produces tilings with many long, skinny rectangles. In 1998, Martin Wattenberg and Jarke van Wijk independently invented "squarifying" algorithms that created tilings whose rectangles were closer to square. Using this algorithm, Wattenberg created the first web treemap, the SmartMoney Map of the Market, which displayed data on hundreds of companies in the U.S. stock market. Following its launch, treemaps enjoyed a surge of interest, especially in financial contexts.[citation needed]

A third wave of treemap innovation came around 2002, after Marcos Weskamp created the "Newsmap", a treemap that displayed news headlines. This example of a non-analytical treemap inspired many imitators, and introduced treemaps to a new, broad audience. In recent years, treemaps have made their way into the mainstream media, including usage by the New York Times.

See also

Examples

Academic descriptions

Open source

Commercial

  • Panopticon Software offers interactive, real-time enabled treemap software as desktop or web software, Java and .NET SDKs.
  • Macrofocus Treemap An easy to use treemapping tool with some examples (Commercial).
  • Lab Escape's Heat Map Explorer available for the desktop, web or enterprise, or as a treemap SDK.
  • The Hive Group develops enterprise treemap software that is used by major corporations and government agencies.
  • ILOG JViews Charts, a commercial Java library with a thin client demo
  • ILOG Elixir, a commercial Flex library with a Flex/Flash demo
  • Cross-platform: AVS OpenViz offers commercial custom made Desktop, Enterprise, and Web enabled Treemap software
  • Incito offer enterprise and desktop Treemap products, that provide easy to use visual analysis tools.
  • MagnaView offers commercial desktop and enterprise visualization products, including a generalized version of treemaps.
  • TreeSize displays used hard disk space as Treemap.
  • FolderSizes provides a hierarchical folder map view, based upon treemap data visualization technique.
  • SAS/Graph GTile Procedure
Retrieved from "https://en.wikipedia.org/w/index.php?title=Treemapping&oldid=319055969"