Fully automatic visualisation of overlapping sets

Computer Graphics Forum

Volumn 28, Issue 3, 2009, Pages 967-974

  Simonetto, Paolo ^a   Auber, David ^a   Archambault, Daniel ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GRAPHICS;

ACTIVE AREA; APPLICATION FIELDS; AUTOMATIC GENERATION; EULER DIAGRAMS; EXECUTABLE PROGRAMS; HIERARCHY TREES;

VISUALIZATION;

EID: 68549097884     PISSN: 01677055     EISSN: 14678659     Source Type: Journal    
DOI: 10.1111/j.1467-8659.2009.01452.x     Document Type: Article

References (22)

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 area-proportional 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.