Stapleton, Gem and Zhang, Leishi and Howse, John and Rodgers, Peter (2011) Drawing Euler Diagrams with Circles: The Theory of Piercings. IEEE Transactions on Visualization and Computer Graphics, 17 (7). pp. 182-196. (doi:https://doi.org/10.1109/TVCG.2010.119) (Full text available)
Euler diagrams are effective tools for visualizing set intersections. They have a large number of application areas ranging from statistical data analysis to software engineering. However, the automated generation of Euler diagrams has never been easy: given an abstract description of a required Euler diagram, it is computationally expensive to generate the diagram. Moreover, the generated diagrams represent sets by polygons, sometimes with quite irregular shapes which make the diagrams less comprehensible. In this paper we address these two issues by developing the theory of piercings, where we define single piercing curves and double piercing curves. We prove that if a diagram can be built inductively by successively adding piercing curves under certain constraints then it can be drawn with circles, which are more aesthetically pleasing than arbitrary polygons. The theory of piercings is developed at the abstract level. In addition, we present a Java implementation that, given an inductively pierced abstract description, generates an Euler diagram consisting only of circles within polynomial time.
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Sciences > School of Computing > Computational Intelligence Group|
|Depositing User:||Peter Rodgers|
|Date Deposited:||21 Sep 2012 09:49 UTC|
|Last Modified:||19 Nov 2012 09:51 UTC|
|Resource URI:||https://kar.kent.ac.uk/id/eprint/30750 (The current URI for this page, for reference purposes)|