Generating simple convex Venn diagrams

DOI10.1016/j.jda.2012.04.013zbMath1255.68193OpenAlexW1999899863MaRDI QIDQ1932372

Frank Ruskey, Khalegh Mamakani, Wendy J. Myrvold

Publication date: 18 January 2013

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2012.04.013

zbMATH Keywords

symmetryexhaustive enumerationGrünbaum encodingspherical Venn diagram

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

New roses: simple symmetric Venn diagrams with 11 and 13 curves ⋮ Equivalences in Euler-based diagram systems through normal forms

Uses Software

• plantri

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spherical Venn diagrams with involutory isometries
• Venn diagrams and symmetric chain decompositions in the Boolean lattice
• Half-simple symmetric Venn diagrams
• Venn diagrams and planar graphs
• Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams
• Venn Diagrams and Independent Families of Sets
• Seven-Set Venn Diagrams with Rotational and Polar Symmetry
• Venn Symmetry and Prime Numbers: A Seductive Proof Revisited