Flower, Jean and HOWSE, JOHN (2002) Generating Euler diagrams In: Proceedings of the 2nd International Conference, Diagrams 2002, Callaway Gardens, GA, USA, 18-20 April, 2002.Full text not available from this repository.
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.
|Item Type:||Contribution to conference proceedings in the public domain ( Full Paper)|
|Uncontrolled Keywords:||Visual languages; Euler diagrams|
|Subjects:||G000 Computing and Mathematical Sciences > G100 Mathematics|
|DOI (a stable link to the resource):||10.1007/3-540-46037-3_6|
|Faculties:||Faculty of Science and Engineering > School of Computing, Engineering and Mathematics > Visual Modelling|
|Date Deposited:||28 Sep 2007|
|Last Modified:||04 Oct 2013 08:26|
Actions (login required)
Downloads per month over past year