Treemapping

From HandWiki
Revision as of 17:32, 6 February 2024 by Wincert (talk | contribs) (linkage)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Short description: Visualisation method for hierchical data
Treemap of Singapore's exports by product category, 2012. The Product Exports Treemaps are one of the most recent applications of these kind of visualizations, developed by the Harvard-MIT Observatory of Economic Complexity.

In information visualization and computing, treemapping is a method for displaying hierarchical data using nested figures, usually rectangles.

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 of the data.[1] 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, such as whether a certain color is particularly relevant. 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.

Tiling algorithms

To create a treemap, one must define a tiling algorithm, that is, a way to divide a region into sub-regions of specified areas. Ideally, a treemap algorithm would create regions that satisfy the following criteria:

  1. A small aspect ratio—ideally close to one. Regions with a small aspect ratio (i.e., fat objects) are easier to perceive.[2]
  2. Preserve some sense of the ordering in the input data (ordered).
  3. Change to reflect changes in the underlying data (high stability).

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.[example needed]

Rectangular treemaps

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

Treemap algorithms[3]
Algorithm Order Aspect ratios Stability
BinaryTree partially ordered high stable
Slice And Dice[4] ordered very high stable
Strip[5] ordered medium medium stability
Pivot by middle[6] ordered medium medium stability
Pivot by split[6] ordered medium low stability
Pivot by size[6] ordered medium medium stability
Split[7] ordered medium medium stability
Spiral[8] ordered medium medium stability
Hilbert[9] ordered medium medium stability
Moore[9] ordered medium medium stability
Squarified[10] ordered low low stability
unordered low medium stability
Approximation[11] unordered low medium stability
Git[12] unordered medium stable
Local moves[13] unordered medium stable

Convex treemaps

Rectangular treemaps have the disadvantage that their aspect ratio might be arbitrarily high in the worst case. As a simple example, if the tree root has only two children, one with weight [math]\displaystyle{ 1/n }[/math] and one with weight [math]\displaystyle{ 1-1/n }[/math], then the aspect ratio of the smaller child will be [math]\displaystyle{ n }[/math], which can be arbitrarily high. To cope with this problem, several algorithms have been proposed that use regions that are general convex polygons, not necessarily rectangular.

Convex treemaps were developed in several steps, each step improved the upper bound on the aspect ratio. The bounds are given as a function of [math]\displaystyle{ n }[/math] - the total number of nodes in the tree, and [math]\displaystyle{ d }[/math] - the total depth of the tree.

  1. Onak and Sidiropoulos[14] proved an upper bound of [math]\displaystyle{ O((d\log{n})^{17}) }[/math].
  2. De-Berg and Onak and Sidiropoulos[15] improve the upper bound to [math]\displaystyle{ O(d+\log{n}) }[/math], and prove a lower bound of [math]\displaystyle{ O(d) }[/math].
  3. De-Berg and Speckmann and van-der-Weele[16] improve the upper bound to [math]\displaystyle{ O(d) }[/math], matching the theoretical lower bound. (For the special case where the depth is 1, they present an algorithm that uses only four classes of 45-degree-polygons (rectangles, right-angled triangles, right-angled trapezoids and 45-degree pentagons), and guarantees an aspect ratio of at most 34/7.)

The latter two algorithms operate in two steps (greatly simplified for clarity):

  1. The original tree is converted to a binary tree: each node with more than two children is replaced by a sub-tree in which each node has exactly two children.
  2. Each region representing a node (starting from the root) is divided to two, using a line that keeps the angles between edges as large as possible. It is possible to prove that, if all edges of a convex polygon are separated by an angle of at least [math]\displaystyle{ \phi }[/math], then its aspect ratio is [math]\displaystyle{ O(1/\phi) }[/math]. It is possible to ensure that, in a tree of depth [math]\displaystyle{ d }[/math], the angle is divided by a factor of at most [math]\displaystyle{ d }[/math], hence the aspect ratio guarantee.

Orthoconvex treemaps

In convex treemaps, the aspect ratio cannot be constant - it grows with the depth of the tree. To attain a constant aspect-ratio, Orthoconvex treemaps[16] can be used. There, all regions are orthoconvex rectilinear polygons with aspect ratio at most 64; and the leaves are either rectangles with aspect ratio at most 8, or L-shapes or S-shapes with aspect ratio at most 32.

For the special case where the depth is 1, they present an algorithm that uses only rectangles and L-shapes, and the aspect ratio is at most [math]\displaystyle{ 2 + 2 /\sqrt{3} \approx 3.15 }[/math]; the internal nodes use only rectangles with aspect ratio at most [math]\displaystyle{ 1+\sqrt{3} \approx 2.73 }[/math].

Other treemaps

Voronoi Treemaps
[17] based on Voronoi diagram calculations. The algorithm is iterative and does not give any upper bound on the aspect ratio.
Jigsaw Treemaps[18]
based on the geometry of space-filling curves. They assume that the weights are integers and that their sum is a square number. The regions of the map are rectilinear polygons and highly non-ortho-convex. Their aspect ratio is guaranteed to be at most 4.
GosperMaps
[19] based on the geometry of Gosper curves. It is ordered and stable, but has a very high aspect ratio.

History

Hard disk space usage visualized in TreeSize, software first released in 1996

Area-based visualizations have existed for decades. For example, mosaic plots (also known as Marimekko diagrams) use rectangular tilings to show joint distributions (i.e., most commonly they are essentially stacked column plots where the columns are of different widths). 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 professor Ben Shneiderman at the University of Maryland Human – Computer Interaction Lab in the early 1990s. [20][21] 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 desirable 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 1994 Mountaz Hascoet and Michel Beaudouin-Lafon invented a "squarifying" algorithm, later popularized by Jarke van Wijk, that created tilings whose rectangles were closer to square. In 1999 Martin Wattenberg used a variation of the "squarifying" algorithm that he called "pivot and slice" to create the first Web-based 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 2004, 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.[citation needed] In recent years, treemaps have made their way into the mainstream media, including usage by the New York Times.[22][23] The Treemap Art Project[24] produced 12 framed images for the National Academies (United States), shown the Every AlgoRiThm has ART in It exhibit[25] in Washington, DC and another set for the collection of Museum of Modern Art in New York.

See also

References

  1. ↑ Li, Rita Yi Man; Chau, Kwong Wing; Zeng, Frankie Fanjie (2019). "Ranking of Risks for Existing and New Building Works". Sustainability 11 (10): 2863. doi:10.3390/su11102863. 
  2. ↑ Kong, N; Heer, J; Agrawala, M (2010). "Perceptual Guidelines for Creating Rectangular Treemaps". IEEE Transactions on Visualization and Computer Graphics 16 (6): 990–8. doi:10.1109/TVCG.2010.186. PMID 20975136. 
  3. ↑ Vernier, E.; Sondag, M.; Comba, J.; Speckmann, B.; Telea, A.; Verbeek, K. (2020). "Quantitative Comparison of Time-Dependent Treemaps". Computer Graphics Forum 39 (3): 393–404. doi:10.1111/cgf.13989. 
  4. ↑ Shneiderman, Ben (2001). "Ordered treemap layouts". Infovis: 73. http://cvs.cs.umd.edu/~ben/papers/Shneiderman2001Ordered.pdf. 
  5. ↑ Benjamin, Bederson; Shneiderman, Ben; Wattenberg, Martin (2002). "Ordered and quantum treemaps: Making effective use of 2D space to display hierarchies". ACM Transactions on Graphics 21 (4): 833–854. doi:10.1145/571647.571649. http://www.cs.umd.edu/hcil/trs/2001-18/2001-18.pdf. 
  6. ↑ 6.0 6.1 6.2 Shneiderman, Ben; Wattenberg, Martin (2001). "Ordered treemap layouts". IEEE Symposium on Information Visualization: 73–78. 
  7. ↑ Engdahl, Björn. Ordered and quantum treemaps: Making effective use of 2D space to display hierarchies. 
  8. ↑ Tu, Y.; Shen, H. (2007). "Visualizing changes of hierarchical data using treemaps". IEEE Transactions on Visualization and Computer Graphics 13 (6): 1286–1293. doi:10.1109/TVCG.2007.70529. PMID 17968076. https://web.cse.ohio-state.edu/~shen.94/Research/Highlight_Papers/H6_files/Tu2007.pdf. 
  9. ↑ 9.0 9.1 Tak, S.; Cockburn, A. (2013). "Enhanced spatial stability with Hilbert and Moore treemaps". IEEE Transactions on Visualization and Computer Graphics 19 (1): 141–148. doi:10.1109/TVCG.2012.108. PMID 22508907. https://publications.tno.nl/publication/101111/1nYAEU/tak-2012-enhanced.pdf. 
  10. ↑ Bruls, Mark; Huizing, Kees; van Wijk, Jarke J. (2000). "Squarified treemaps". in de Leeuw, W.; van Liere, R.. Data Visualization 2000: Proc. Joint Eurographics and IEEE TCVG Symp. on Visualization. Springer-Verlag. pp. 33–42. http://www.win.tue.nl/~vanwijk/stm.pdf. .
  11. ↑ Nagamochi, H.; Abe, Y.; Wattenberg, Martin (2007). "An approximation algorithm for dissect-ing a rectangle into rectangles with specified areas". Discrete Applied Mathematics 155 (4): 523–537. doi:10.1016/j.dam.2006.08.005. 
  12. ↑ Vernier, E.; Comba, J.; Telea, A. (2018). "Quantitative comparison of dy-namic treemaps for software evolution visualization". Conferenceon Software Visualization: 99–106. 
  13. ↑ Sondag, M.; Speckmann, B.; Verbeek, K. (2018). "Stable treemaps via local moves". IEEE Transactions on Visualization and Computer Graphics 24 (1): 729–738. doi:10.1109/TVCG.2017.2745140. PMID 28866573. https://research.tue.nl/nl/publications/3703f11d-9a71-42b2-93b3-2ef941ee6fcd. 
  14. ↑ Krzysztof Onak; Anastasios Sidiropoulos. "Circular Partitions with Applications to Visualization and Embeddings". http://people.csail.mit.edu/konak/papers/socg_2008-circular_partitions_with_applications_to_visualization_and_embeddings.html. 
  15. ↑ Mark de Berg; Onak, Krzysztof; Sidiropoulos, Anastasios (2013). "Fat Polygonal Partitions with Applications to Visualization and Embeddings". Journal of Computational Geometry 4 (1): 212–239. https://jocg.org/index.php/jocg/article/view/2945. 
  16. ↑ 16.0 16.1 De Berg, Mark; Speckmann, Bettina; Van Der Weele, Vincent (2014). "Treemaps with bounded aspect ratio". Computational Geometry 47 (6): 683. doi:10.1016/j.comgeo.2013.12.008. . Conference version: "Convex Treemaps with Bounded Aspect Ratio". EuroCG. 2011. http://alexandria.tue.nl/openaccess/Metis253577.pdf. 
  17. ↑ Balzer, Michael; Deussen, Oliver (2005). "IEEE Symposium on Information Visualization (InfoVis 2005), 23-25 October 2005, Minneapolis, MN, USA". in Stasko, John T.; Ward, Matthew O.. IEEE Computer Society. pp. 7. http://graphics.uni-konstanz.de/publikationen/2005/voronoi_treemaps/Balzer%20et%20al.%20--%20Voronoi%20Treemaps.pdf. .
  18. ↑ Wattenberg, Martin (2005). "IEEE Symposium on Information Visualization (InfoVis 2005), 23-25 October 2005, Minneapolis, MN, USA". in Stasko, John T.; Ward, Matthew O.. IEEE Computer Society. pp. 24. http://hint.fm/papers/158-wattenberg-final3.pdf. .
  19. ↑ Auber, David; Huet, Charles; Lambert, Antoine; Renoust, Benjamin; Sallaberry, Arnaud; Saulnier, Agnes (2013). "Gosper Map: Using a Gosper Curve for laying out hierarchical data". IEEE Transactions on Visualization and Computer Graphics 19 (11): 1820–1832. doi:10.1109/TVCG.2013.91. PMID 24029903. http://www.computer.org/csdl/trans/tg/2013/11/ttg2013111820-abs.html. .
  20. ↑ Shneiderman, Ben (1992). "Tree visualization with tree-maps: 2-d space-filling approach". ACM Transactions on Graphics 11: 92–99. doi:10.1145/102377.115768. 
  21. ↑ Ben Shneiderman; Catherine Plaisant (June 25, 2009). "Treemaps for space-constrained visualization of hierarchies ~ Including the History of Treemap Research at the University of Maryland". http://www.cs.umd.edu/hcil/treemap-history/index.shtml. 
  22. ↑ Cox, Amanda; Fairfield, Hannah (February 25, 2007). "The health of the car, van, SUV, and truck market". The New York Times. https://www.nytimes.com/imagepages/2007/02/25/business/20070225_CHRYSLER_GRAPHIC.html. 
  23. ↑ Carter, Shan; Cox, Amanda (February 14, 2011). "Obama's 2012 Budget Proposal: How $3.7 Trillion is Spent". The New York Times. https://www.nytimes.com/packages/html/newsgraphics/2011/0119-budget/index.html?hp. 
  24. ↑ "Treemap Art". http://treemapart.wordpress.com. 
  25. ↑ "Every AlgoRiThm has ART in it: Treemap Art Project". http://www.cpnas.org/exhibitions/archive/every-algorithm-has-art-in.html. 

External links



Retrieved from "https://handwiki.org/wiki/index.php?title=Treemapping&oldid=3369449"