all_set_combinations

Generates labels in cardinality-first order: singletons first, then pairs,
then triples, etc. Within each cardinality, set names appear in their
original order. Used only by the Venn path (bounded at n = 5).

internal

Generate area-proportional Euler diagrams
using numerical optimization. A Euler diagram is a generalization of a Venn
diagram, relaxing the criterion that all interactions need to be
represented. Diagrams may be fit with circles, ellipses, squares, and
rectangles via a wide range of inputs and can be visualized in numerous ways.

Johan Larsson

eulerr

Area-Proportional Euler and Venn Diagrams

A. Jonathan R. Godfrey

Peter Gustafsson

David H. Eberly

Emanuel Huber

Florian Privé

all_set_combinations function

<dl><dt>setnames</dt>
<dd>a character vector of set names</dd></dl>

Arguments

Enumerate all 2^n - 1 combination labels for a set of names — all_set_combinations

<dl>

<dt>setnames</dt>
<dd>a character vector of set names</dd>

</dl>

all_set_combinations: Enumerate all 2^n - 1 combination labels for a set of names

Description

Usage

Value

Arguments