Abstract
Venn diagrams have long been used as an aid in understanding set containment relationships and in certain logical arguments. They also have interesting combinatorial properties. This talk is a survey some of what is known about Venn diagrams, particularly the aesthetic and extremal properties of the drawings, including recent results about symmetric Venn diagrams. Connections with graph drawing, of which there are many, will be emphasized. For more about Venn diagrams see http://www.theory.cs.uvic.ca/R~cos/venn.
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ruskey, F. (2002). Drawing Venn Diagrams. In: Goodrich, M.T., Kobourov, S.G. (eds) Graph Drawing. GD 2002. Lecture Notes in Computer Science, vol 2528. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36151-0_43
Download citation
DOI: https://doi.org/10.1007/3-540-36151-0_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00158-4
Online ISBN: 978-3-540-36151-0
eBook Packages: Springer Book Archive