Skip to main content

Embedding wellformed Euler diagrams

Rodgers, Peter, Zhang, Leishi, Stapleton, Gem, Fish, Andrew (2008) Embedding wellformed Euler diagrams. In: Information Visualisation, 2008. IV '08. 12th International Conference. IEEE International Conference on Information Visualisation , 12. pp. 585-593. IEEE ISBN 978-0-7695-3268-4. (doi:10.1109/IV.2008.57) (KAR id:15623)

PDF
Language: English
Download (265kB) Preview
[thumbnail of ewfed.pdf]
Preview
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL
http://dx.doi.org/10.1109/IV.2008.57

Abstract

Euler diagrams are collections of labelled closed curves. They are often used to represent information about the relationship between sets and, as such, they have numerous applications including: visualizing biological data, diagrammatic logics, and visual database querying. Various methods to automatically generate Euler diagrams have been proposed recently. Typically, the generation process starts with an abstract description of an Euler diagram, which is then converted to a planar dual graph. Finally, the process attempts to embed the Euler diagram from the dual graph. This paper describes a method for embedding wellformed Euler diagrams from dual graphs. There are several mechanisms to generate dual graphs but, prior to the novel work described here, no general method for embedding a wellformed Euler diagram from a dual graph had been demonstrated. The method in this paper achieves an embedding of any wellformed Euler diagram. The method first triangulates the dual graph. Then, using the faces of the triangulated graph, an edge labelling technique identifies the vertices of polygons which form the closed curves of the Euler diagram. The method is demonstrated by a Java implementation. In addition, this paper discusses a number of layout improvements that can be explored for this embedding method.

Item Type: Conference or workshop item (Paper)
DOI/Identification number: 10.1109/IV.2008.57
Uncontrolled keywords: Euler diagrams; Venn diagrams; graph drawing; information visualization
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Peter Rodgers
Date Deposited: 03 Mar 2010 14:09 UTC
Last Modified: 16 Feb 2021 12:26 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/15623 (The current URI for this page, for reference purposes)
Rodgers, Peter: https://orcid.org/0000-0002-4100-3596
  • Depositors only (login required):

Downloads

Downloads per month over past year