Subscribe

Issue No.01 - January (2011 vol.17)

pp: 88-100

Gem Stapleton , University of Brighton, Brighton, UK

Peter Rodgers , University of Kent, Canterbury, UK

John Howse , University of Brighton, Brighton, UK

Leishi Zhang , University of Kent, Canterbury, UK

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TVCG.2010.28

ABSTRACT

Euler diagrams have a wide variety of uses, from information visualization to logical reasoning. In all of their application areas, the ability to automatically layout Euler diagrams brings considerable benefits. In this paper, we present a novel approach to Euler diagram generation. We develop certain graphs associated with Euler diagrams in order to allow curves to be added by finding cycles in these graphs. This permits us to build Euler diagrams inductively, adding one curve at a time. Our technique is adaptable, allowing the easy specification, and enforcement, of sets of well-formedness conditions; we present a series of results that identify properties of cycles that correspond to the well-formedness conditions. This improves upon other contributions toward the automated generation of Euler diagrams which implicitly assume some fixed set of well-formedness conditions must hold. In addition, unlike most of these other generation methods, our technique allows any abstract description to be drawn as an Euler diagram. To establish the utility of the approach, a prototype implementation has been developed.

INDEX TERMS

Information visualization, diagram layout, diagram generation, Euler diagrams, Venn diagrams.

CITATION

Gem Stapleton, Peter Rodgers, John Howse, Leishi Zhang, "Inductively Generating Euler Diagrams",

*IEEE Transactions on Visualization & Computer Graphics*, vol.17, no. 1, pp. 88-100, January 2011, doi:10.1109/TVCG.2010.28REFERENCES

- [1] L. Euler, "Lettres a Une Princesse D'allemagne Sur Divers Sujets de Physique et de Philosophie,"
Letters, vol. 2, pp. 102-108, 1775.- [2] R. DeChiara, U. Erra, and V. Scarano, "VennFS: A Venn Diagram File Manager,"
Proc. Seventh Int'l Conf. Information Visualization, pp. 120-126, 2003.- [3] S.-K. Kim and D. Carrington, "Visualization of Formal Specifications,"
Proc. Sixth Asia Pacific Software Eng. Conf., pp. 102-109, 1999.- [4] L. Niebrój, "Defining Health/Illness: Societal and/or Clinical Medicine?"
J. Physiology and Pharmacology, vol. 57, no. 4, pp. 251-262, 2006.- [5] P. Hayes, T. Eskridge, R. Saavedra, T. Reichherzer, M. Mehrotra, and D. Bobrovnikoff, "Collaborative Knowledge Capture in Ontologies,"
Proc. Int'l Conf. Knowledge Capture, pp. 99-106, 2005.- [6] H. Kestler, A. Muller, T. Gress, and M. Buchholz, "Generalized Venn Diagrams: A New Method for Visualizing Complex Genetic Set Relations,"
Bioinformatics, vol. 21, no. 8, pp. 1592-1595, 2005.- [7] J. Thièvre, M. Viaud, and A. Verroust-Blondet, "Using Euler Diagrams in Traditional Library Environments,"
Proc. Euler Diagrams Conf., pp. 189-202, 2005.- [8] S. Chow, "Generating and Drawing Area-Proportional Euler and Venn Diagrams," PhD dissertation, Univ. of Victoria, 2007.
- [9] S. Chow and F. Ruskey, "Towards a General Solution to Drawing Area-Proportional Euler Diagrams,"
Proc. Euler Diagrams Conf., pp. 3-18, 2005.- [10] S. Chow and F. Ruskey, "Drawing Area-Proportional Venn and Euler Diagrams,"
Graph Drawing, pp. 466-477, Springer, 2003.- [11] H. Kestler, A. Muller, J. Kraus, M. Buchholz, T. Gress, H. Liu, D. Kane, B. Zeeberg, and J. Weinstein, "Vennmaster: Area-Proportional Euler Diagrams for Functional Go Analysis of Microarrays,"
BMC Bioinformatics, vol. 9, no. 67, 2008.- [12] P. Simonetto and D. Auber, "Visualise Undrawable Euler Diagrams,"
Proc. 12th Int'l Conf. Information Visualization, pp. 594-599, 2008.- [13] A. Verroust and M.-L. Viaud, "Ensuring the Drawability of Euler Diagrams for up to Eight Sets,"
Proc. Third Int'l Conf. Theory and Application of Diagrams, pp. 128-141, 2004.- [14] J. Flower and J. Howse, "Generating Euler Diagrams,"
Proc. Second Int'l Conf. Theory and Application of Diagrams, pp. 61-75, 2002.- [15] P. Rodgers, L. Zhang, and A. Fish, "General Euler Diagram Generation,"
Proc. Fifth Int'l Conf. Theory and Application of Diagrams, pp. 13-27, 2008.- [16] J. Venn, "On the Diagrammatic and Mechanical Representation of Propositions and Reasonings,"
London, Edinburgh, and Dublin Philosophical Magazine and J. Science, vol. 9, pp. 1-18, 1880.- [17] A.W. Edwards, "Venn Diagrams for Many Sets,"
New Scientist, vol. 7, pp. 51-56, 1989.- [18] G. Stapleton, J. Masthoff, J. Flower, A. Fish, and J. Southern, "Automated Theorem Proving in Euler Diagrams Systems,"
J. Automated Reasoning, vol. 39, pp. 431-470, 2007.- [19] N. Swoboda and G. Allwein, "Using DAG Transformations to Verify Euler/Venn Homogeneous and Euler/Venn FOL Heterogeneous Rules of Inference,"
Software and System Modeling, vol. 3, no. 2, pp. 136-149, 2004.- [20] G. Stapleton, J. Howse, P. Rodgers, and L. Zhang, "Generating Euler Diagrams from Existing Layouts,"
Proc. Conf. Layout of (Software) Eng. Diagrams, 2008.- [21] G. Stapleton, P. Rodgers, J. Howse, and L. Zhang, "Inductively Generating Euler Diagrams: Appendices," technical report, Univ. of Brighton, 2009.
- [22] G. Stapleton, P. Rodgers, J. Howse, and J. Taylor, "Properties of Euler Diagrams,"
Proc. Conf. Layout of (Software) Eng. Diagrams, pp. 2-16, 2007.- [23] J. Flower, J. Howse, and J. Taylor, "Nesting in Euler Diagrams: Syntax, Semantics and Construction,"
Software and Systems Modeling, vol. 3, pp. 55-67, 2004.- [24] A. Fish and J. Flower, "Abstractions of Euler Diagrams,"
Proc. Euler Diagrams Conf., pp. 77-101, 2005.- [25] O. Lemon and I. Pratt, "Spatial Logic and the Complexity of Diagrammatic Reasoning,"
Machine Graphics and Vision, vol. 6, no. 1, pp. 89-108, 1997.- [26] H. Kestler, J. Messner, A. Müller, and R. Schuler, "On the Complexity of Intersecting Multiple Circles for Graphical Display," technical report, Univ. of Ulm, http://www.uni-ulm.de/fileadmin/website_uni_ulm/ iui/Ulmer_Informatik_Berichte/2008 UIB-2008-01.pdf, 2008.
- [27] C. Iwamoto and G. Toussaint, "Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete,"
Information Processing Letters, vol. 52, pp. 183-189, 1994.- [28] M. Garey, D. Johnson, and R. Tarjan, "The Planar Hamiltonian Circuit Problem is NP-Complete,"
SIAM J. Computing, vol. 5, pp. 704-714, 1976.- [29] F. Benoy and P. Rodgers, "Evaluating the Comprehension of Euler Diagrams,"
Proc. 11th Int'l Conf. Information Visualization, pp. 771-778, 2007.- [30] J. Flower, P. Rodgers, and P. Mutton, "Layout Metrics for Euler Diagrams,"
Proc. Seventh Int'l Conf. Information Visualization, pp. 272-280, 2003.- [31] A. Fish and J. Flower, "Euler Diagram Decomposition,"
Proc. Fifth Int'l Conf. Theory and Application of Diagrams, pp. 28-44, 2008. |