Which n-Venn diagrams can be drawn with convex k-gons?

DOI10.1007/S00454-007-1311-1zbMATH Open1118.52002OpenAlexW2025569303MaRDI QIDQ2369930FDOQ2369930

Authors: Jeremy Carroll, Frank Ruskey, Mark Weston 

Publication date: 21 June 2007

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-007-1311-1

Recommendations

• scientific article; zbMATH DE number 3959489
• Generating simple convex Venn diagrams
• Minimal convex \(k\)-gons containing a given convex polygon
• Counting convex \(k\)-gons in planar point sets
• Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams
• On \(k\)-convex polygons
• Counting \(k\)-subsets and convex \(k\)-gons in the plane
• Geometric drawings of \(K_{n}\) with few crossings
• The smallest convex \(k\)-gon containing \(n\) congruent disks

zbMATH Keywords

convex curve\(n\)-gonVenn diagramsimple diagramsymmetric diagram

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Convex sets in (2) dimensions (including convex curves) (52A10)

Cited In (2)

• Efficient on-line algorithms for Euler diagram region computation
• Minimum area polyomino Venn diagrams

This page was built for publication: Which \(n\)-Venn diagrams can be drawn with convex \(k\)-gons?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369930)