Location of Repository

Abstract Euler Diagram Isomorphism

By Gem Stapleton, Andrew Fish and Peter Rodgers

Abstract

Euler diagrams are widely used for information visualization and form the basis of a variety of formal languages that are used to express constraints in computing. Tools to automatically generate and layout these diagrams from an abstract description have to overcome the fact that this problem is computationally difficult. We develop a theory of isomorphism of diagram descriptions and identify invariants of these descriptions under isomorphism. We can apply this theory to improve the efficiency of the generation of all abstract descriptions (up to isomorphism). We can also consider the production and use of libraries of diagrams with nice visual properties: by providing a normal form for the abstract descriptions we can improve efficiency of searches for isomorphic diagrams within such libraries and, moreover, utilize invariants for further efficiency savings. We produce an implementation of the theory and give an indication of the efficiency improvements

Topics: QA76
Publisher: Knowledge Systems Institute
Year: 2008
OAI identifier: oai:kar.kent.ac.uk:24019

Suggested articles

Preview

Citations

  1. (2004). A global constraint for graph isomorphism problems. doi
  2. (2005). A system for virtual directories using Euler diagrams. doi
  3. (1993). Applied and algorithmic graph theory.
  4. (2007). Automated theorem proving in Euler diagrams systems. doi
  5. (2005). Collaborative knowledge capture in ontologies. doi
  6. (1997). Constraint diagrams: Visualizing invariants in object oriented modelling. doi
  7. (2002). Constraint satisfaction algorithms for graph pattern matching. doi
  8. (2003). Drawing area-proportional Venn and Euler diagrams. doi
  9. (2004). Ensuring the drawability of Euler diagrams for up to eight sets. doi
  10. (2008). Euler diagram generation. doi
  11. (2005). Generalized Venn diagrams: A new method for visualizing complex genetic set relations. doi
  12. (2005). Generalized Venn diagrams: A new method for visualizing complex geneticsetrelations. doi
  13. (2002). Generating Euler diagrams. doi
  14. (2004). Heterogeneous reasoning with Euler/Venn diagrams containing named constants and FOL. doi
  15. (1999). Hypergraph isomorphism and structural equivalence of boolean functions. doi
  16. (1965). Introduction to Switching and Automata Theory.
  17. (2004). Nesting in Euler diagrams: syntax, semantics and construction. doi
  18. (1981). Practical graph isomorphism. doi
  19. (2005). Precise visual modelling. doi
  20. (2005). Spider diagrams. doi
  21. (2004). The expressiveness of spider diagrams. doi
  22. (2005). Towards a general solution to drawing area-proportional Euler diagrams. doi
  23. (2002). Towards a Visual Editing Environment for the Languages of the Semantic Web.
  24. (2004). Using DAG transformations to verify Euler/Venn homogeneous and Euler/Venn FOL heterogeneous rules of inference. doi
  25. (2004). Using euler diagrams in traditional library environments. doi
  26. (1999). Visualization of formal speciļ¬cations. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.