Treemapping

Last updated
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. 2012 Singapore Products Export Treemap.png
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.

Contents

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]
AlgorithmOrderAspect ratiosStability
BinaryTreepartially orderedhighstable
Slice And Dice [4] orderedvery highstable
Strip [5] orderedmediummedium stability
Pivot by middle [6] orderedmediummedium stability
Pivot by split [6] orderedmediumlow stability
Pivot by size [6] orderedmediummedium stability
Split [7] orderedmediummedium stability
Spiral [8] orderedmediummedium stability
Hilbert [9] orderedmediummedium stability
Moore [9] orderedmediummedium stability
Squarified [10] orderedlowlow stability
Mixed Treemaps [11] unorderedlowmedium stability
Approximation [12] unorderedlowmedium stability
Git [13] unorderedmediumstable
Local moves [14] unorderedmediumstable

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 and one with weight , then the aspect ratio of the smaller child will be , 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 - the total number of nodes in the tree, and - the total depth of the tree.

  1. Onak and Sidiropoulos [15] proved an upper bound of .
  2. De-Berg and Onak and Sidiropoulos [16] improve the upper bound to , and prove a lower bound of .
  3. De-Berg and Speckmann and van-der-Weele [17] improve the upper bound to , 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 , then its aspect ratio is . It is possible to ensure that, in a tree of depth , the angle is divided by a factor of at most , 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 [17] 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 ; the internal nodes use only rectangles with aspect ratio at most .

Other treemaps

Voronoi Treemaps
[18] based on Voronoi diagram calculations. The algorithm is iterative and does not give any upper bound on the aspect ratio.
Jigsaw Treemaps [19]
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
[20] 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 Tree Map.png
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. [21] [22] 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. [23] [24] The Treemap Art Project [25] produced 12 framed images for the National Academies (United States), shown the Every AlgoRiThm has ART in It exhibit [26] in Washington, DC and another set for the collection of Museum of Modern Art in New York.

See also

Related Research Articles

<span class="mw-page-title-main">Binary search tree</span> Rooted binary tree data structure

In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each internal node being greater than all the keys in the respective node's left subtree and less than the ones in its right subtree. The time complexity of operations on the binary search tree is linear with respect to the height of the tree.

<span class="mw-page-title-main">Tree structure</span> Way of representing the hierarchical nature of a structure in a graphical form

A tree structure, tree diagram, or tree model is a way of representing the hierarchical nature of a structure in a graphical form. It is named a "tree structure" because the classic representation resembles a tree, although the chart is generally upside down compared to a biological tree, with the "stem" at the top and the "leaves" at the bottom.

<span class="mw-page-title-main">Binary space partitioning</span> Method for recursively subdividing a space into two subsets using hyperplanes

In computer science, binary space partitioning (BSP) is a method for space partitioning which recursively subdivides a Euclidean space into two convex sets by using hyperplanes as partitions. This process of subdividing gives rise to a representation of objects within the space in the form of a tree data structure known as a BSP tree.

<span class="mw-page-title-main">Quadtree</span> Tree data structure in which each internal node has exactly four children, to partition a 2D area

A quadtree is a tree data structure in which each internal node has exactly four children. Quadtrees are the two-dimensional analog of octrees and are most often used to partition a two-dimensional space by recursively subdividing it into four quadrants or regions. The data associated with a leaf cell varies by application, but the leaf cell represents a "unit of interesting spatial information".

<span class="mw-page-title-main">R-tree</span> Data structures used in spatial indexing

R-trees are tree data structures used for spatial access methods, i.e., for indexing multi-dimensional information such as geographical coordinates, rectangles or polygons. The R-tree was proposed by Antonin Guttman in 1984 and has found significant use in both theoretical and applied contexts. A common real-world usage for an R-tree might be to store spatial objects such as restaurant locations or the polygons that typical maps are made of: streets, buildings, outlines of lakes, coastlines, etc. and then find answers quickly to queries such as "Find all museums within 2 km of my current location", "retrieve all road segments within 2 km of my location" or "find the nearest gas station". The R-tree can also accelerate nearest neighbor search for various distance metrics, including great-circle distance.

<i>k</i>-d tree Multidimensional search tree for points in k dimensional space

In computer science, a k-d tree is a space-partitioning data structure for organizing points in a k-dimensional space. K-dimensional is that which concerns exactly k orthogonal axes or a space of any number of dimensions. k-d trees are a useful data structure for several applications, such as:

<span class="mw-page-title-main">Ben Shneiderman</span> American computer scientist

Ben Shneiderman is an American computer scientist, a Distinguished University Professor in the University of Maryland Department of Computer Science, which is part of the University of Maryland College of Computer, Mathematical, and Natural Sciences at the University of Maryland, College Park, and the founding director (1983-2000) of the University of Maryland Human-Computer Interaction Lab. He conducted fundamental research in the field of human–computer interaction, developing new ideas, methods, and tools such as the direct manipulation interface, and his eight rules of design.

Jock D. Mackinlay is an American information visualization expert and Vice President of Research and Design at Tableau Software. With Stuart Card, George G. Robertson and others he invented a number of information visualization techniques.

Martin M. Wattenberg is an American scientist and artist known for his work with data visualization. He is currently the Gordon McKay Professor of Computer Science at the Harvard University School of Engineering and Applied Sciences.

Ming C. Lin is an American computer scientist and a former chair of the Department of Computer Science at the University of Maryland, College Park, where she also holds an endowed faculty position as the Elizabeth Stevinson Iribe Chair of Computer Science. Prior to moving to Maryland in 2018, Lin was the John R. & Louise S. Parker Distinguished Professor of Computer Science at the University of North Carolina at Chapel Hill.

Marc Frons is the former chief technology officer of News Corp. He was named to the role in May 2017 after serving in an interim capacity since October 2016. Prior to that, he was SVP, deputy head of technology, and global head of mobile platform at the company. Frons was previously chief information officer of The New York Times and former head of both NYTimes.com Digital Technology and The Times's corporate systems and technology. From July 2006 to March 2012, Frons served as the chief technology officer of the New York Times. Since 2006, he has overseen technology and product development at NYTimes.com while continuing to be involved in broader digital strategy initiatives at the company. Before he joined The Times, Frons was the chief technology officer for The Wall Street Journal Online and other Dow Jones consumer Web sites. He is credited for the development of Map of the Market, an innovative financial data visualization interface for smartmoney.com and more recently the latest advancements in the customization algorithms that introduce readers to content based on their archived readings as well as the influx of interactivity within a media-rich foundation of NYTimes.com.

Jarke J. (Jack) van Wijk is a Dutch computer scientist, a professor in the Department of Mathematics and Computer Science at the Eindhoven University of Technology, and an expert in information visualization.

<span class="mw-page-title-main">Jean-Daniel Fekete</span>

Jean-Daniel Fekete is a French computer scientist.

In computer science, one approach to the dynamic optimality problem on online algorithms for binary search trees involves reformulating the problem geometrically, in terms of augmenting a set of points in the plane with as few additional points as possible to avoid rectangles with only two points on their boundary.

A software map represents static, dynamic, and evolutionary information of software systems and their software development processes by means of 2D or 3D map-oriented information visualization. It constitutes a fundamental concept and tool in software visualization, software analytics, and software diagnosis. Its primary applications include risk analysis for and monitoring of code quality, team activity, or software development progress and, generally, improving effectiveness of software engineering with respect to all related artifacts, processes, and stakeholders throughout the software engineering process and software maintenance.

In geometry, a covering of a polygon is a set of primitive units whose union equals the polygon. A polygon covering problem is a problem of finding a covering with a smallest number of units for a given polygon. This is an important class of problems in computational geometry. There are many different polygon covering problems, depending on the type of polygon being covered. An example polygon covering problem is: given a rectilinear polygon, find a smallest set of squares whose union equals the polygon.

<span class="mw-page-title-main">Chord diagram (information visualization)</span>

A chord diagram is a graphical method of displaying the inter-relationships between data in a matrix. The data are arranged radially around a circle with the relationships between the data points typically drawn as arcs connecting the data.

The IEEE Visualization Conference (VIS) is an annual conference on scientific visualization, information visualization, and visual analytics administrated by the IEEE Computer Society Technical Committee on Visualization and Graphics. As ranked by Google Scholar's h-index metric in 2016, VIS is the highest rated venue for visualization research and the second-highest rated conference for computer graphics over all. It has an 'A' rating from the Australian Ranking of ICT Conferences, an 'A' rating from the Brazilian ministry of education, and an 'A' rating from the China Computer Federation (CCF). The conference is highly selective with generally < 25% acceptance rates for all papers.

Niklas Elmqvist is a Swedish-American computer scientist. He is currently a professor in the Department of Computer Science at Aarhus University, and a Villium Investigator. He is the Director of the Center for Anytime Anywhere Analytics at Aarhus University, a research center on augmented reality and extended reality (AR/XR) for data visualization.

Steven Mark Drucker is an American computer scientist who studies how to help people understand data, and communicate their insights to others. He is a Partner at Microsoft Research, where he also serves as the Research Manager of the VIDA group. Drucker is an affiliate professor at the University of Washington Computer Science and Engineering Department.

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. CiteSeerX   10.1.1.688.4140 . doi:10.1109/TVCG.2010.186. PMID   20975136. S2CID   11597084.
  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. arXiv: 1906.06014 . doi:10.1111/cgf.13989. S2CID   189898065.
  4. ↑ Shneiderman, Ben (2001). "Ordered treemap layouts" (PDF). Infovis: 73.
  5. ↑ Benjamin, Bederson; Shneiderman, Ben; Wattenberg, Martin (2002). "Ordered and quantum treemaps: Making effective use of 2D space to display hierarchies" (PDF). ACM Transactions on Graphics. 21 (4): 833–854. CiteSeerX   10.1.1.145.2634 . doi:10.1145/571647.571649. S2CID   7253456.
  6. 1 2 3 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" (PDF). IEEE Transactions on Visualization and Computer Graphics. 13 (6): 1286–1293. doi:10.1109/TVCG.2007.70529. PMID   17968076. S2CID   14206074 . Archived (PDF) from the original on Aug 8, 2022.
  9. 1 2 Tak, S.; Cockburn, A. (2013). "Enhanced spatial stability with Hilbert and Moore treemaps" (PDF). IEEE Transactions on Visualization and Computer Graphics. 19 (1): 141–148. doi:10.1109/TVCG.2012.108. PMID   22508907. S2CID   6099935.
  10. ↑ Bruls, Mark; Huizing, Kees; van Wijk, Jarke J. (2000). "Squarified treemaps". In de Leeuw, W.; van Liere, R. (eds.). Data Visualization 2000: Proc. Joint Eurographics and IEEE TCVG Symp. on Visualization (PDF). Springer-Verlag. pp. 33–42..
  11. ↑ Roel Vliegen; Erik-Jan van der Linden; Jarke J. van Wijk. "Visualizing Business Data with Generalized Treemaps" (PDF). Archived from the original (PDF) on July 24, 2011. Retrieved February 24, 2010.
  12. ↑ 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 .
  13. ↑ Vernier, E.; Comba, J.; Telea, A. (2018). "Quantitative comparison of dy-namic treemaps for software evolution visualization". Conferenceon Software Visualization: 99–106.
  14. ↑ 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. S2CID   27739774.
  15. ↑ Krzysztof Onak; Anastasios Sidiropoulos. "Circular Partitions with Applications to Visualization and Embeddings" . Retrieved June 26, 2011.
  16. ↑ 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. arXiv: 1009.1866 .
  17. 1 2 De Berg, Mark; Speckmann, Bettina; Van Der Weele, Vincent (2014). "Treemaps with bounded aspect ratio". Computational Geometry . 47 (6): 683. arXiv: 1012.1749 . doi: 10.1016/j.comgeo.2013.12.008 . S2CID   12973376.. Conference version: Convex Treemaps with Bounded Aspect Ratio (PDF). EuroCG. 2011.
  18. ↑ Balzer, Michael; Deussen, Oliver (2005). "Voronoi Treemaps". In Stasko, John T.; Ward, Matthew O. (eds.). IEEE Symposium on Information Visualization (InfoVis 2005), 23-25 October 2005, Minneapolis, MN, USA (PDF). IEEE Computer Society. p. 7..
  19. ↑ Wattenberg, Martin (2005). "A Note on Space-Filling Visualizations and Space-Filling Curves". In Stasko, John T.; Ward, Matthew O. (eds.). IEEE Symposium on Information Visualization (InfoVis 2005), 23-25 October 2005, Minneapolis, MN, USA (PDF). IEEE Computer Society. p. 24..
  20. ↑ 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. S2CID   15050386..
  21. ↑ 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. hdl: 1903/367 . S2CID   1369287.
  22. ↑ 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" . Retrieved February 23, 2010.
  23. ↑ Cox, Amanda; Fairfield, Hannah (February 25, 2007). "The health of the car, van, SUV, and truck market". The New York Times. Retrieved March 12, 2010.
  24. ↑ Carter, Shan; Cox, Amanda (February 14, 2011). "Obama's 2012 Budget Proposal: How $3.7 Trillion is Spent". The New York Times. Retrieved February 15, 2011.
  25. ↑ "Treemap Art". Archived from the original on Dec 5, 2023.
  26. ↑ "Every AlgoRiThm has ART in it: Treemap Art Project". CPNAS. Archived from the original on Oct 8, 2023.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.