@inproceedings{e173ba59b75647759992a37f08ab6c04,

title = "Generating Euler diagrams",

abstract = "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.",

keywords = "Visual languages, Euler diagrams",

author = "Jean Flower and John Howse",

year = "2002",

month = jan,

day = "1",

doi = "10.1007/3-540-46037-3_6",

language = "English",

isbn = "9783540435617",

volume = "2317",

series = "Lecture Notes in Computer Science",

publisher = "Springer-Verlag",

pages = "61--75",

booktitle = "Proceedings of the 2nd International Conference, Diagrams 2002",

note = "Proceedings of the 2nd International Conference, Diagrams 2002 ; Conference date: 01-01-2002",

}