Skip to main content
View expanded cover

International Conference on Theory and Application of Diagrams

Diagrams 2006: Diagrammatic Representation and Inference pp 267–282Cite as

Exploring the Notion of ‘Clutter’ in Euler Diagrams

  • Conference paper

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

Abstract

Euler diagrams are an effective and intuitive way of representing relationships between sets. As the number of sets represented grows, Euler diagrams can become ‘cluttered’ and lose some of their intuitive appeal. In this paper we consider various measures of ‘clutter’ for abstract Euler diagrams and show that they compare well with results obtained from an empirical study. We also show that all abstract Euler diagrams can be constructed inductively by inserting a contour at a time and we relate this inductive description to the clutter metrics.

Keywords

  • Closed Curf
  • Single Zone
  • Euler Diagram
  • Nest Depth
  • Concrete Version

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/11783183_36
  • Chapter length: 16 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   64.99
Price excludes VAT (USA)
  • ISBN: 978-3-540-35624-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   84.99
Price excludes VAT (USA)
Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bertini, E., Santucci, G.: Improving 2D Scatterplots Effectiveness through Sampling, Displacement, and User Perception. In: Ninth International Conference on Information Visualisation (IV 2005), pp. 826–834 (2005)

    Google Scholar 

  2. Flower, J., Howse, J., Taylor, J.: Nesting in Euler diagrams: syntax, semantics and construction. J. Software Systems Modeling 3, 55–67 (2004)

    CrossRef  Google Scholar 

  3. Flower, J., Masthoff, J., Stapleton, G.: Generating Readable Proofs: A Heuristic Approach to Theorem Proving With Spider Diagrams. In: Blackwell, A.F., Marriott, K., Shimojima, A. (eds.) Diagrams 2004. LNCS (LNAI), vol. 2980, pp. 166–181. Springer, Heidelberg (2004)

    CrossRef  Google Scholar 

  4. Gil, J., Howse, J., Kent, S., Taylor, J.: Projections in Venn-Euler Diagrams. In: Proc. IEEE Symposium on Visual Languages (VL 2000), pp. 119–126. IEEE, Los Alamitos (2000)

    CrossRef  Google Scholar 

  5. Howse, J., Molina, F., Shin, S.-J., Taylor, J.: On Diagram Tokens and Types. In: Hegarty, M., Meyer, B., Narayanan, N.H. (eds.) Diagrams 2002. LNCS (LNAI), vol. 2317, pp. 146–160. Springer, Heidelberg (2002)

    CrossRef  Google Scholar 

  6. Howse, J., Stapleton, G., Taylor, J.: Spider Diagrams. LMS J. Comput. Math. 8, 145–194 (2005)

    MATH  MathSciNet  Google Scholar 

  7. John, C.: Measuring and reducing clutter in Euler diagrams. In: Proc. 1st International workshop on Euler diagrams. ENTCS, vol. 134, pp. 103–126. Elsevier, Amsterdam (2005)

    Google Scholar 

  8. Lloyd, N.: Clutter measurement & reduction for enhanced information visualization. Masters thesis, Worcester Polytechnic Institute, Available at: www.wpi.edu/Pubs/ETD/Available/etd-011206-232808/unrestricted/nlloyd.pdf

  9. Peng, W., Ward, M., Rundensteiner, E.: Clutter Reduction in Multi-Dimensional Data Visualization Using Dimension Reordering. In: IEEE Symposium on Information Visualization (INFOVIS 2004), pp. 89–96 (2004)

    Google Scholar 

  10. Rosenholtz, R., Li, Y., Mansfield, J., Jin, Z.: Feature Congestion: A Measure of Display Clutter. In: Proc. SIGCHI conference on Human Factors in Computing Systems, pp. 761–770 (2005)

    Google Scholar 

  11. Shin, S.-J.: The Logical Status of Diagrams. Cambridge University Press, Cambridge (1994)

    MATH  Google Scholar 

  12. Wickens, C.: Display Formatting and Situation Awareness Model (DFSAM): An approach to aviation display. Technical report AHFD-05-14/NASA-05-5 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Visual Modelling Group, School of Computing, Mathematical and Information Sciences, University of Brighton, Brighton, UK

    Chris John, Andrew Fish, John Howse & John Taylor

Authors
  1. Chris John
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew Fish
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. John Howse
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. John Taylor
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Stanford University,, 94305-4101, Stanford, CA, USA

    Dave Barker-Plummer

  2. Representation and Cognition Group, University of Sussex, Brighton, UK

    Richard Cox

  3. Universidad Politécnica de Madrid, Boadilla del Monte, 28660, Madrid, Spain

    Nik Swoboda

Rights and permissions

Reprints and Permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

John, C., Fish, A., Howse, J., Taylor, J. (2006). Exploring the Notion of ‘Clutter’ in Euler Diagrams. In: Barker-Plummer, D., Cox, R., Swoboda, N. (eds) Diagrammatic Representation and Inference. Diagrams 2006. Lecture Notes in Computer Science(), vol 4045. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11783183_36

Download citation

  • DOI: https://doi.org/10.1007/11783183_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35623-3

  • Online ISBN: 978-3-540-35624-0

  • eBook Packages: Computer ScienceComputer Science (R0)