Generating Euler diagrams

Jean Flower, John Howse

Research output: Chapter in Book/Conference proceeding with ISSN or ISBNConference contribution with ISSN or ISBNpeer-review


This article describes an algorithm for the automated generation of any Euler diagram starting with an abstract description of the diagram. An automated generation mechanism for Euler diagrams forms the foundations of a generation algorithm for notations such as Harel's higraphs, constraint diagrams and some of the UML notation. An algorithm to generate diagrams is an essential component of a diagram tool for users to generate, edit and reason with diagrams. The work makes use of properties of the dual graph of an abstract diagram to identify which abstract diagrams are "drawable" within given wellformedness rules on concrete diagrams. A Java program has been written to implement the algorithm and sample output is included.
Original languageEnglish
Title of host publicationProceedings of the 2nd International Conference, Diagrams 2002
Place of PublicationBerlin, Germany
Number of pages15
ISBN (Electronic)9783540460374
ISBN (Print)9783540435617
Publication statusPublished - 1 Jan 2002
EventProceedings of the 2nd International Conference, Diagrams 2002 - Callaway Gardens, GA, USA, 18-20 April, 2002
Duration: 1 Jan 2002 → …

Publication series

NameLecture Notes in Computer Science


ConferenceProceedings of the 2nd International Conference, Diagrams 2002
Period1/01/02 → …


  • Visual languages
  • Euler diagrams


Dive into the research topics of 'Generating Euler diagrams'. Together they form a unique fingerprint.

Cite this