Drawing graphs in Euler diagrams

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2980, Issue , 2004, Pages 66-81

  Mutton, Paul ^a   Rodgers, Peter ^a   Flower, Jean ^b  

^a UNIVERSITY OF KENT   (United Kingdom)

^b UNIVERSITY OF BRIGHTON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; GRAPHIC METHODS; MAPPING; OPTIMIZATION; SCHEMATIC DIAGRAMS; VISUALIZATION; GRAPH THEORY;

EDGE CROSSINGS; EULER DIAGRAMS; NODES; SPIDER DIAGRAMS; CONNECTED COMPONENT; DRAWING PROCESS; EMBEDDED GRAPHS; FORCE-BASED METHODS; HILL-CLIMBING METHODS; LOGICAL EXPRESSIONS; THREE-STAGE METHOD;

GRAPH THEORY; GRAPHIC METHODS;

EID: 9444259811     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-25931-2_9     Document Type: Conference Paper

References (23)

1. Fran, ois Bertault, Peter Eades. Drawing Hypergraphs in the Subset Standard. GD 2000. LNCS 1984. pp. 164-169.
2. R. De Chiara, U Erra and V. Scarano. VENNFS: A Venn-Diagram File Manager. IEEE Proceedings of Information Visualization (IV03). pp. 120-126. 2003.
3. M.P. Consens and A.O. Mendelzon. Hy+: A Hygraph-based Query and Visualization System. Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pp. 511-516, 1993.
4. Peter Eades, Qingwen Feng. Multilevel Visualization of Clustered Graphs. GD 1996. LNCS 1190. pp. 101-112.
5. Fish, J. Flower, and J. Howse. A Reading Algorithm for Constraint Diagrams. Proc. IEEE 2003 symposium on Human-Centric Computing languages and environments (HCC '03), pp. 161-168.
6. Fish, and J. Howse Computing Reading Trees for Constraint Diagrams. To appear in Proceedings of ACTIVE '03.
7. J. Flower and J. Howse. Generating Euler Diagrams, Proc. Diagrams 2002, Springer Verlag, pp. 61-75. 2002.
8. J. Flower, P. Rodgers and P. Mutton. Layout Metrics for Euler Diagrams. Proc. IEEE Information Visualization (IV03). pp. 272-280. 2003.
9. J. Flower and G. Stapleton. Automated Theorem Proving with Spider Diagrams. To appear in proc. Computing Australasian Theory Symposium (CATS04).
10. J. Flower, J. Masthoff and G. Stapleton. Generating Readable Proofs: A Heuristic Approach to Theorem Proving With Spider Diagrams, Diagrams '04.
11. J. Flower, J. Howse and J. Taylor. Nesting in Euler Diagrams, Syntax, Semantics and Construction. In Journal of Software and Systems Modelling (SoSyM), Springer Verlag, Issue 1, article 5.
12. T.M.J. Fruchterman, E.M. Reingold. Graph Drawing by Force-directed Placement. Software - Practice and Experience Vol 21(11). pp. 1129-1164. 1991.
13. D. Harel. On Visual Formalisms. Communications of the ACM. 31(5). pp. 514-530. 1988.
14. David Harel, Gregory Yashchin. An Algorithm for Blob Hierarchy Layout. Working Conference on Advanced Visual Interfaces, pp. 29-40, May 2000.
15. Higraph web page: http://db.uwaterloo.ca/~gweddell/higraph/higraph.html.
16. J. Howse, F. Molina, J. Taylor, S. Kent. Reasoning with Spider Diagrams, Proc. IEEE Symposium on Visual Languages 1999 (VL99), IEEE Press, 138-147.
17. Erkki Mkinen, How to draw a hypergraph. International Journal of Computer Mathematics 34 (1990), 177-185.
18. G. Stapleton, J. Howse, J. Taylor and S. Thompson. What Can Spider Diagrams Say? Diagrams 2004.
19. G. Stapleton, J. Howse and J. Taylor. A Constraint Diagram Reasoning System. Proc Visual Languages and Computing '03, pp. 263-270.
20. Visual Modelling Group: technical report on spider diagram reasoning systems at www.cmis.brighton.ac.uk/research/vmg/SDRules.html.
21. R. Davidson, D. Harel. Drawing Graphs Nicely Using Simulated Annealing. ACM Transactions of Graphics, Vol. 15, No. 4, pp. 301-331. 1996.
22. S. Chow and F. Ruskey. Drawing Area-Proportional Venn and Euler Diagrams. To appear in Proceedings of GD2003. LNCS. Springer Verlag.
23. Howse J, Molina F, Taylor J, On the completeness and expressiveness of spider diagram systems. Proceeding of Diagrams 2000, Edinburgh 2000, LNAI 1889, Springer-Verlag, 26-41.