Euler diagram generation

Authors:
J. Flower;A. Fish;J. Howse
Affiliations:
School of Computing, Mathematical and Information Sciences, University of Brighton, Watts Building, Moulsecoomb, Brighton BN2 4GJ, UK;School of Computing, Mathematical and Information Sciences, University of Brighton, Watts Building, Moulsecoomb, Brighton BN2 4GJ, UK;School of Computing, Mathematical and Information Sciences, University of Brighton, Watts Building, Moulsecoomb, Brighton BN2 4GJ, UK
Venue:
Journal of Visual Languages and Computing
Year:
2008

Citing 14
Cited 12

Constraint diagrams: visualizing invariants in object-oriented models

Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Decidability of string graphs

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Logic and Visual Information

Logic and Visual Information
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
Generating Euler Diagrams

DIAGRAMS '02 Proceedings of the Second International Conference on Diagrammatic Representation and Inference
On Diagram Tokens and Types

DIAGRAMS '02 Proceedings of the Second International Conference on Diagrammatic Representation and Inference
VENNFS: A Venn-Diagram File Manager

IV '03 Proceedings of the Seventh International Conference on Information Visualization
Recognizing string graphs in NP

Journal of Computer and System Sciences - STOC 2002
Generalized Venn diagrams: a new method of visualizing complex genetic set relations

Bioinformatics
The Expressiveness of Spider Diagrams

Journal of Logic and Computation
A reading algorithm for constraint diagrams

HCC '03 Proceedings of the 2003 IEEE Symposium on Human Centric Computing Languages and Environments
Automated Theorem Proving in Euler Diagram Systems

Journal of Automated Reasoning
Abstractions of Euler Diagrams

Electronic Notes in Theoretical Computer Science (ENTCS)
The semantics of augmented constraint diagrams

Journal of Visual Languages and Computing

Conceptual Spider Diagrams

ICCS '08 Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning
General Euler Diagram Generation

Diagrams '08 Proceedings of the 5th international conference on Diagrammatic Representation and Inference
Euler Diagram Decomposition

Diagrams '08 Proceedings of the 5th international conference on Diagrammatic Representation and Inference
A Normal Form for Euler Diagrams with Shading

Diagrams '08 Proceedings of the 5th international conference on Diagrammatic Representation and Inference
Efficient on-line algorithms for Euler diagram region computation

Computational Geometry: Theory and Applications
Coloured euler diagrams: a tool for visualizing dynamic systems and structured information

Diagrams'10 Proceedings of the 6th international conference on Diagrammatic representation and inference
Path-based supports for hypergraphs

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Blocks of hypergraphs: applied to hypergraphs and outerplanarity

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Personalised resource categorisation using euler diagrams

IS-EUD'11 Proceedings of the Third international conference on End-user development
Path-based supports for hypergraphs

Journal of Discrete Algorithms
Euler diagram encodings

Diagrams'12 Proceedings of the 7th international conference on Diagrammatic Representation and Inference
Fully automatic visualisation of overlapping sets

EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization

Quantified Score

Hi-index	0.01

Visualization

Abstract

Euler diagrams form the basis of many diagrammatic notations used to represent set theoretic relationships in a wide range of contexts including: file system information, statistical data representation, object-oriented modeling, logical specification and reasoning systems, and database search queries. An abstract Euler diagram is a formal abstract description of the information that is to be displayed as a concrete (or drawn) Euler diagram. If the abstract diagram can be visualized, whilst satisfying certain desirable visual properties (called well-formedness conditions), then we say the diagram is drawable. We solve the drawability problem for a given set of well-formedness conditions, identifying the properties which classify a diagram as drawable or undrawable. Furthermore, we present a high level algorithm which enables the generation of a concrete diagram from an abstract diagram, whenever it is drawable.