An n-Venn diagram consists of n curves drawn in the plane in such a way that each of the 2n possible intersections of the interiors and exteriors of the curves forms a connected non-empty region. A Venn diagram is convexly-drawable if it can be drawn with all curves convex and it is simple if at most two curves intersect at any point. A Venn diagram is called polar symmetric if its stereographic projection about the infinite outer face is isomorphic to the projection about the innermost face. We outline an algorithm that shows there are exactly 375 simple convexly drawable polar-symmetric 6-Venn diagrams. © 2011 Springer-Verlag.
CITATION STYLE
Mamakani, K., Myrvold, W., & Ruskey, F. (2011). Generating all simple convexly-drawable polar symmetric 6-Venn diagrams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7056 LNCS, pp. 275–286). https://doi.org/10.1007/978-3-642-25011-8_22
Mendeley helps you to discover research relevant for your work.