Fish, Andrew and Stapleton, Gem (2006) Defining Euler diagrams: simple or what? In: Proceedings of the 4th International Conference, Diagrams 2006, Stanford, CA, USA, 28-30 June, 2006.Full text not available from this repository.
Euler diagrams are emerging as a powerful tool in a variety of application areas, such as logical reasoning and for representing statistical data. In order to be a reliable means of visualizing information, Euler diagrams must have a firm theoretical underpinning and various formalizations have been given. We illustrate, via pertinent examples, misconceptions and pitfalls that occur as a result of imposing certain well-formedness conditions. In particular, we consider the effect on the interpretation of diagrams, on giving precise definitions and on reasoning systems. First, we highlight some consequences of stipulating that the closed curves must be simple. Secondly, we demonstrate some of the difficulties associated with choosing not to enforce simplicity. We also consider the consequences of defining Euler diagrams inductively and enforcing the connectedness of minimal regions. Choices made when formalizing Euler diagrams can have a profound effect on reasoning systems due to the potential inability to draw a diagram which represents a given collection of set intersections. The issues raised are likely to be interesting to any researcher who is defining diagrams based on closed curves.
|Item Type:||Contribution to conference proceedings in the public domain (Extended Abstract)|
|Additional Information:||The original publication is available at www.springerlink.com|
|Uncontrolled Keywords:||Euler diagrams|
|Subjects:||G000 Computing and Mathematical Sciences|
|DOI (a stable link to the resource):||10.1007/11783183_14|
|Faculties:||Faculty of Science and Engineering > School of Computing, Engineering and Mathematics > Visual Modelling|
|Date Deposited:||24 Nov 2007|
|Last Modified:||14 Apr 2015 13:06|
Actions (login required)
Downloads per month over past year