Movatterモバイル変換


[0]ホーム

URL:


Skip to main content

Advertisement

Springer Nature Link
Log in

Enriching Indented Pixel Tree Plots with Node-Oriented Quantitative, Categorical, Relational, and Time-Series Data

  • Conference paper

Part of the book series:Lecture Notes in Computer Science ((LNAI,volume 7352))

Included in the following conference series:

  • 1498Accesses

  • 3Citations

Abstract

Indented Pixel Tree Plots are useful for an overview of large and deep hierarchical data. As a major benefit, these plots scale to pixel or even subpixel resolution, still clearly visualizing the hierarchical structures and substructures in a redundant-free representation. Consequently, there is display space available that may be used to show additional information such as enlarged or filtered subregions, details-on-demand, or control panels. In this paper, we demonstrate how this compact indented diagram can be enriched with additional data associated with both leaf and inner nodes of the hierarchy. To this end, we support quantitative, categorical, relational, and time-series data. By such a combination, exploration and analysis of visual patterns and anomalies on different levels of hierarchical granularity are possible in a static diagram. Furthermore, interactive features such as expanding/collapsing of subhierarchies, horizontal/vertical distortions, zooming in/out, or details-on-demand are integrated to allow the user to inspect the data from different viewpoints. The usefulness of the enriched diagrams is illustrated by applying them to file system data where single software constructs are hierarchically organized. Here, we focus on quantitative, categorical, and relational data attached to the nodes of the hierarchy. In a second case study, we demonstrate how evolving water level data of rivers in Germany can be represented by our plots.

This is a preview of subscription content,log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide -see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Andrews, K., Heidegger, H.: Information Slices: Visualising and Exploring Large Hierarchies Using Cascading, Semi-Circular Discs. In: Proceedings of the IEEE Symposium on Information Visualization, pp. 9–12 (1998)

    Google Scholar 

  2. Burch, M., Beck, F., Diehl, S.: Timeline Trees: Visualizing Sequences of Transactions in Information Hierarchies. In: Proceedings of Advanced Visual Interfaces, pp. 75–82 (2008)

    Google Scholar 

  3. Burch, M., Vehlow, C., Beck, F., Diehl, S., Weiskopf, D.: Parallel Edge Splatting for Scalable Dynamic Graph Visualization. IEEE Transactions on Visualization and Computer Graphics 17(12), 2344–2353 (2011)

    Article  Google Scholar 

  4. Burch, M., Heinrich, J., Konevtsova, N., Höferlin, M., Weiskopf, D.: Evaluation of Traditional, Orthogonal, and Radial Tree Diagrams by an Eye Tracking Study. IEEE Transactions on Visualization and Computer Graphics 17(12), 2440–2448 (2011)

    Article  Google Scholar 

  5. Burch, M., Raschke, M., Weiskopf, D.: Indented Pixel Tree Plots. In: Bebis, G., Boyle, R., Parvin, B., Koracin, D., Chung, R., Hammoud, R., Hussain, M., Kar-Han, T., Crawfis, R., Thalmann, D., Kao, D., Avila, L. (eds.) ISVC 2010. LNCS, vol. 6453, pp. 338–349. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Burch, M., Schmauder, H., Weiskopf, D.: Indented Pixel Tree Browser for Exploring Huge Hierarchies. In: Proceedings of the International Symposium on Visual Computing, pp. 301–312 (2011)

    Google Scholar 

  7. Burch, M., Weiskopf, D.: Visualizing Dynamic Quantitative Data in Hierarchies. In: Proceedings of International Conference on Information Visualization Theory and Applications, pp. 177–186 (2011)

    Google Scholar 

  8. Burch, M., Diehl, S.: Trees in a Treemap: Visualizing Multiple Hierarchies. In: Proceedings of Visualization and Data Analysis, pp. 224–235 (2006)

    Google Scholar 

  9. Card, S.K., Mackinlay, J.: The Structure of the Information Visualization Design Space. In: Proceedings of the IEEE Symposium on Information Visualization, pp. 92–99 (1997)

    Google Scholar 

  10. Cleveland, W.S., McGill, R.: Graphical Perception: Theory, Experimentation, and Application to the Development of Graphical Methods. Journal of the American Statistical Association 79(387), 531–554 (1984)

    MathSciNet  Google Scholar 

  11. Eades, P.: Drawing Free Trees. Bulletin of the Institute for Combinatorics and its Applications 5, 10–36 (1992)

    MathSciNet MATH  Google Scholar 

  12. Eisen, M., Spellman, P., Brown, P., Botstein, D.: Cluster Analysis and Display of Genome-Wide Expression Patterns. Proceedings of the National Academy of Sciences 95, 14863–14868 (1998)

    Article  Google Scholar 

  13. Fekete, J.-D., Wang, D., Dang, N., Aris, A., Plaisant, C.: Overlaying Graph Links on Treemaps. In: Proceedings of the IEEE Symposium on Information Visualization, Poster Compendium, pp. 82–83 (2003)

    Google Scholar 

  14. Kruskal, J., Landwehr, J.: Icicle Plots: Better Displays for Hierarchical Clustering. The American Statistician 37(2), 162–168 (1983)

    Google Scholar 

  15. Jin, L., Banks, D.C.: TennisViewer: A Browser for Competition Trees. IEEE Computer Graphics and Applications 17(4), 63–65 (1997)

    Article  Google Scholar 

  16. McGuffin, M.J., Robert, J.M.: Quantifying the Space-Efficiency of 2D Graphical Representations of Trees. Information Visualization 9(2), 115–140 (2009)

    Article  Google Scholar 

  17. Neumann, P., Schlechtweg, S., Carpendale, S.: ArcTrees: Visualizing Relations in Hierarchical Data. In: Proceedings of Eurographics IEEE VGTC Symposium on Visualization, pp. 53–60 (2005)

    Google Scholar 

  18. Reingold, E.M., Tilford, J.S.: Tidier Drawings of Trees. IEEE Transactions on Software Engineering 7, 223–228 (1981)

    Article  Google Scholar 

  19. Jürgensmann, S., Schulz, H.-J.: A Visual Survey of Tree Visualization. In: Proceedings of the IEEE Conference on Information Visualization, Poster Compendium (2010)

    Google Scholar 

  20. Schulz, H.-J.: Treevis.net: A Tree Visualization Reference. IEEE Computer Graphics and Applications 31(6), 11–15 (2011)

    Article  Google Scholar 

  21. Shneiderman, B.: Tree Visualization with Tree-Maps: 2-D Space-Filling Approach. ACM Transactions on Graphics 11(1), 92–99 (1992)

    Article MATH  Google Scholar 

  22. Shneiderman, B.: The Eyes Have It: A Task by Data Type Taxonomy for Information Visualizations. In: Proceedings of the IEEE Symposium on Visual Languages, pp. 336–343 (1996)

    Google Scholar 

  23. Stasko, J.T., Zhang, E.: Focus+Context Display and Navigation Techniques for Enhancing Radial, Space-Filling Hierarchy Visualizations. In: Proceedings of the IEEE Symposium on Information Visualization, pp. 57–65 (2000)

    Google Scholar 

  24. Tu, Y., Shen, H.-W.: Visualizing Changes of Hierarchical Data Using Treemaps. IEEE Transactions on Visualization and Computer Graphics 13(6), 1286–1293 (2007)

    Article  Google Scholar 

  25. Tversky, B., Bauer Morrison, J., Bétrancourt, M.: Animation: Can it Facilitate? International Journal of Human-Computer Studies 57(4), 247–262 (2002)

    Article  Google Scholar 

  26. Yang, J., Ward, M.O., Rundensteiner, E.A., Patro, A.: InterRing: A Visual Interface for Navigating and Manipulating Hierarchies. Information Visualization 2(1), 16–30 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. VISUS, University of Stuttgart, Germany

    Michael Burch, Michael Raschke, Miriam Greis & Daniel Weiskopf

Authors
  1. Michael Burch
  2. Michael Raschke
  3. Miriam Greis
  4. Daniel Weiskopf

Editor information

Editors and Affiliations

  1. Faculty of Computer Science, Dalhousie University, 6050 University Avenue, B3H 1W4, Halifax, NS, Canada

    Philip Cox

  2. Department of Computer Science, University of Auckland, Private bag 92019, Auckland, New Zealand

    Beryl Plimmer

  3. School of Computing, Unviersity of Kent, CT2 7NF, Canterbury, UK

    Peter Rodgers

Rights and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Burch, M., Raschke, M., Greis, M., Weiskopf, D. (2012). Enriching Indented Pixel Tree Plots with Node-Oriented Quantitative, Categorical, Relational, and Time-Series Data. In: Cox, P., Plimmer, B., Rodgers, P. (eds) Diagrammatic Representation and Inference. Diagrams 2012. Lecture Notes in Computer Science(), vol 7352. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31223-6_14

Download citation

Publish with us

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide -see info

Tax calculation will be finalised at checkout

Purchases are for personal use only


[8]ページ先頭

©2009-2025 Movatter.jp