Skip to main content

Euler Graph Transformations for Euler Diagram Layout

Rodgers, Peter, Stapleton, Gem, Howse, John, Zhang, Leishi (2010) Euler Graph Transformations for Euler Diagram Layout. In: Hundhausen, Christopher and Pietriga, Emmanuel and Diaz, Paloma and Rosson, Mary Beth, eds. IEEE Symposium on Visual Languages and Human Centric Computing 2010. . pp. 182-196. IEEE ISBN 978-1-4244-8485-0. (doi:10.1109/VLHCC.2010.24)


Euler diagrams are frequently used for visualizing information about collections of objects and form an important component of various visual languages. Properties possessed by Euler diagrams correlate with their usability, such as whether the diagram has only simple curves or possesses concurrency. Sometimes, every diagram that represents some given information possesses some undesirable properties, and reducing the number of violations of undesirable properties is beneficial. In this paper we show how to count the number of violations from the reduced Euler graph. We then define various transformations on the Euler graph which can reduce the number of violations of a given property, but sometimes at the expense of increasing the number of violations of another property. These transformations can be used to improve the quality of the drawn diagram, which is important for effective information visualization.

Item Type: Conference or workshop item (Paper)
DOI/Identification number: 10.1109/VLHCC.2010.24
Uncontrolled keywords: concurrent computing; visualization; usability; image edge detection; turning; merging; compounds
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: 28 Feb 2020 05:57 UTC
Resource URI: (The current URI for this page, for reference purposes)
Rodgers, Peter:
  • Depositors only (login required):


Downloads per month over past year