[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1111/j.1467-8659.2009.01452.xguideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Fully automatic visualisation of overlapping sets

Published: 10 June 2009 Publication History

Abstract

Visualisation of taxonomies and sets has recently become an active area of research. Many application fields now require more than a strict classification of elements into a hierarchy tree. Euler diagrams, one of the most natural ways of depicting intersecting sets, may provide a solution to these problems.
In this paper, we present an approach for the automatic generation of Euler-like diagrams. This algorithm differs from previous approaches in that it has no undrawable instances of input, allowing it to be used in systems where the output is always required. We also improve the readability of Euler diagrams through the use of Bézier curves and transparent coloured textures. Our approach has been implemented using the Tulip platform. Both the source and executable program used to generate the results are freely available.

References

[1]
BERTAULT F.: A force-directed algorithm that preserves edge crossing properties. In Graph Drawing (1999), Lecture Notes in Computer Science, Springer, pp. 351-358.
[2]
BADER G. D., HOGUE C. W.: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics 4, 2 (Jan. 13 2003), 27.
[3]
BYELAS H., TELEA A.: Texture-based visualization of metrics on software architectures. In SoftVis08. Proceedings of the 4th ACM symposium on Software visuallization (New York, NY, USA, 2008), ACM, pp. 205-206.
[4]
CHOW S. C.: Generating and drawing areaproportional Euler and Venn diagrams. PhD thesis, 2007.
[5]
DE FRAYSSEIX H., PACH J., POLLACK R.: How to draw a planar graph on a grid. Combinatorica 10 (1990), 41-51.
[6]
EULER L.: Lettres à une princesse d'allemagne, letters no. 102-108, 1761.
[7]
FLOWER J., FISH A., HOWSE J.: Euler diagram generation. Journal of Visual Languages and Computing 19 (Dec. 2008), 675-694.
[8]
FLOWER J., HOWSE J.: Generating Euler diagrams. Lecture Notes in Computer Science 2317 (2002).
[9]
FISH A., STAPLETON G.: Defining Euler diagrams: choices and consequences. Euler Diagrams 2005.
[10]
FISH A., STAPLETON G.: Formal issues in languages based on closed curves. In Distributed Multimedia Systems, Knowledge Systems Institute (2006), pp. 161-167.
[11]
JOHNSON B., SHNEIDERMAN B.: Treemaps: a spacefilling approach to the visualization of hierarchical information structures. In Proc. of the 2nd International IEEE Visualization Conference (1991), pp. 284-291.
[12]
KOENIG P.-Y., MELANÇON G., BOHAN C., GAUTIER B.: Combining DagMaps and Sugiyama layout for the navigation of hierarchical data. In IV (2007), IEEE Computer Society, pp. 447-452.
[13]
PALLA G., DERÉNYI I., FARKAS I., VICSEK T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435 (2005), 814-818.
[14]
RODGERS P., ZHANG L., FISH A.: General Euler diagram generation. vol. 5223, Springer, pp. 13-27.
[15]
RODGERS P., ZHANG L., STAPLETON G., FISH A.: Embedding wellformed Euler diagrams. 12th International Conference on Information Visualisation (2008), 585-593.
[16]
SIMONETTO P., AUBER D.: Visualise undrawable Euler diagrams. In IV08 (July 2008), IEEE Computer Society, pp. 594- 599.
[17]
SIMONETTO P., AUBER D.: An heuristic for the construction of intersection graphs. In IV09 (July 2009), IEEE Computer Society.
[18]
SHANNON P., MARKIEL A., OZIER O., BALIGA N. S., WANG J. T., RAMAGE D., AMIN N., SCHWIKOWSKI B., IDEKER T.: Cytoscape: A software environment for integrated models of biomolecular interaction networks.
[19]
STAPLETON G., RODGERS P., HOWSE J., TAYLOR J.: Properties of Euler diagrams. Electronic Communications of the EASST.
[20]
VERROUST A., VIAUD M.-L.: Ensuring the drawability of extended Euler diagrams for up to 8 sets. In Diagrams 2004, 3rd International Conference. (2004), vol. 2980 of Lecture Notes in Computer Science, Springer, pp. 128-141.
[21]
WARE C.: Information Visualization: Perception for Design. Morgan Kaufmann Publishers, San Francisco, 2000.
[22]
WELSH D., POWELL M.: An upper bound for the chromatic number of a graph and its application to timetabling problems. The Computer Journal 10, 1 (1967), 85-86.

Cited By

View all

Index Terms

  1. Fully automatic visualisation of overlapping sets

      Recommendations

      Comments

      Please enable JavaScript to view thecomments powered by Disqus.

      Information & Contributors

      Information

      Published In

      cover image Guide Proceedings
      EuroVis'09: Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization
      June 2009
      1054 pages

      Sponsors

      • ZIB: ZIB
      • IEEE VGTC: IEEE Visualization and Graphics Technical Committee
      • DFG Research Center Matheon: DFG Research Center Matheon
      • NVIDIA
      • EUROGRAPHICS: The European Association for Computer Graphics

      Publisher

      The Eurographs Association & John Wiley & Sons, Ltd.

      Chichester, United Kingdom

      Publication History

      Published: 10 June 2009

      Qualifiers

      • Article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 29 Jan 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2024)Structure-Aware Simplification for Hypergraph VisualizationIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2024.345636731:1(667-676)Online publication date: 10-Sep-2024
      • (2024)Scalable Hypergraph VisualizationIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2023.332659930:1(595-605)Online publication date: 1-Jan-2024
      • (2023)Topological Simplifications of HypergraphsIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2022.315389529:7(3209-3225)Online publication date: 1-Jul-2023
      • (2022)Attribute-based Explanation of Non-Linear Embeddings of High-Dimensional DataIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2021.311487028:1(540-550)Online publication date: 1-Jan-2022
      • (2022)F2-Bubbles: Faithful Bubble Set Construction and Flexible EditingIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2021.311476128:1(422-432)Online publication date: 1-Jan-2022
      • (2022)GridSet: Visualizing Individual Elements and Attributes for Analysis of Set-Typed DataIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2020.304711128:8(2983-2998)Online publication date: 1-Aug-2022
      • (2022)Systems of Overlap Representation for Families of IntervalsGraphs and Combinatorics10.1007/s00373-021-02417-338:2Online publication date: 1-Apr-2022
      • (2021)Hybrid Line-Based and Region-Based Interactive Set Data VisualizationExtended Abstracts of the 2021 CHI Conference on Human Factors in Computing Systems10.1145/3411763.3451823(1-7)Online publication date: 8-May-2021
      • (2021)Evaluating Free Rides and Observational Advantages in Set VisualizationsJournal of Logic, Language and Information10.1007/s10849-021-09331-030:3(557-600)Online publication date: 1-Sep-2021
      • (2017)Online region computations for Euler diagrams with relaxed drawing conventionsJournal of Visual Languages and Computing10.1016/j.jvlc.2016.10.00638:C(18-37)Online publication date: 1-Feb-2017
      • Show More Cited By

      View Options

      View options

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media