Stapleton, Gem and Flower, Jean and Rodgers, Peter and Howse, John (2012) Automatically Drawing Euler Diagrams with Circles. Journal of Visual Languages and Computing, 23 (3). pp. 163193. (Full text available)
Download (2MB)
Preview



Official URL http://www.cs.kent.ac.uk/pubs/2012/3211 
Abstract
Euler diagrams are used for visualizing categorized data. These categories, together with information about when categories share some datum, can be turned into a succinct diagram description from which an Euler diagram can be generated. Closed curves represent the categories and the relationships between the curves (such as containment) correspond to relationships between the categories (such as subset). A range of automated Euler diagram drawing methods have been proposed but they often produce diagrams that are aesthetically unpleasing, can be computationally complex and most of them cannot draw a diagram for some (often many) given collections of categories. One such method is capable of drawing aesthetically pleasing Euler diagrams, using only circles, and is computationally efficient (being of polynomial time complexity) but it applies to a very restricted subset of collections of categorized data. This paper substantially extends that method so it can always draw an Euler diagram, that is it applies to all collections of categorized data. In particular, we identify a class of diagram descriptions that can be drawn with circles, generalizing previous work. For diagram descriptions outside of this class, we define transformations that can be used to turn them into descriptions inside the drawable with circles class. We demonstrate how such transformations can be done in a general, a process during which many choices must be made. Further, we provide strategies for making particular choices which ensure desirable properties, such as curve containment, are preserved. We have provided a software implementation of the drawing method, which is freely available from www.eulerdiagrams.com/inductivecircles.htm.
Item Type:  Article 

Uncontrolled keywords:  Euler Diagrams, Venn Diagrams 
Subjects:  Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, 
Divisions:  Faculties > Science Technology and Medical Studies > School of Computing > Computational Intelligence Group 
Depositing User:  Peter Rodgers 
Date Deposited:  21 Sep 2012 09:49 
Last Modified:  27 Sep 2012 08:21 
Resource URI:  https://kar.kent.ac.uk/id/eprint/30813 (The current URI for this page, for reference purposes) 
 Export to:
 RefWorks
 EPrints3 XML
 CSV
 Depositors only (login required):
Downloads
Downloads per month over past year