Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Rodgers, Peter; Zhang, Leishi; Stapleton, Gem; Fish, Andrew (2008)
Publisher: IEEE Computer Science
Languages: English
Types: Unknown
Subjects: QA76

Classified by OpenAIRE into

ACM Ref: MathematicsofComputing_DISCRETEMATHEMATICS
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.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] S. Chow and F. Ruskey. Drawing area-proportional Venn and Euler diagrams. In GD 2003. LNCS 2912, pages 466-477. Springer, 2003.
    • [2] R. DeChiara, U. Erra, and V. Scarano. VennFS: A Venn diagram file manager. In Proc. IV03, pages 120- 126. IEEE Computer Society, 2003.
    • [3] A. Fish, J. Flower, and J. Howse. The semantics of augmented constraint diagrams. Journal of Visual Languages and Computing, 16:541-573, 2005.
    • [4] J. Flower and J. Howse. Generating Euler Diagrams, Proc. Diagrams 2002, LNAI 2317, Springer, 2002.
    • [5] J. Flower, A. Fish and J. Howse. Jean Flower. Euler Diagram Generation. To appear in the Journal of Visual Languages and Computing, Elsevier, 2008.
    • [6] J. Flower, J. Howse, and J Taylor. Nesting in Euler diagrams: syntax, semantics and construction, Journal of Software and Systems Modeling, pp 55-67, 2003.
    • [7] J. Flower, P. Rodgers and P. Mutton. Layout Metrics for Euler Diagrams. Proc. IV03. pp. 272-280. 2003.
    • [8] P. Hayes, T. Eskridge, R. Saavedra, T. Reichherzer, M. Mehrotra, and D. Bobrovnikoff. Collaborative knowledge capture in ontologies. In Proc. Knowledge Capture, pp. 99-106, 2005.
    • [9] J. Howse, G. Stapleton, and J. Taylor. Spider diagrams. LMS J. Computation and Mathematics, 8:145-194, 2005.
    • [10] J. Howse and S. Schuman. Precise visual modelling. J. Software and Systems Modeling, 4:310-325, 2005.
    • [11] H. A. Kestler, A. Müller, T.M. Gress and M. Buchholz. Generalized Venn diagrams: a new method of visualizing complex genetic set relations. Bioinformatics 21(8) 2005
    • [12] F. Ruskey. A Survey of Venn Diagrams. The Electronic Journal of Combinatorics. March 2001.
    • [13] H. Sawamura and K. Kiyozuka. JVenn: A visual reasoning system with diagrams and sentences. In Proc. Diagrams 2000, LNAI 1889. pages 271-285. Springer-Verlag, 2000.
    • [14] S.-J. Shin. The Logical Status of Diagrams. CUP, 1994.
    • [15] G. Stapleton, J. Howse, and J. Taylor. A decidable constraint diagram reasoning system. Journal of Logic and Computation, 15(6):975-1008, December 2005.
    • [16] Tavel, P. Modeling and Simulation Design. AK Peters Ltd. 2007
    • [17] A. Verroust and M.-L. Viaud. Ensuring the drawability of Euler diagrams for up to eight sets. Proc. Diagrams 2004, Cambridge, UK. LNAI 2980, pp. 128-141. Springer, 2004.
  • No related research data.
  • No similar publications.

Share - Bookmark

Funded by projects

Cite this article