Studies of Euler diagrams/vidita
This 4-ary Boolean function has 10 of 16 true spots. It is a gap variant of medusa (see here).
![]() |
![]() |
symmetry |
---|
This code is part of a Python library called discrete helpers, which is not yet published. from discretehelpers.boolf.examples import vidita
assert vidita.symmetric_spots.blocks_with_singletons() == [[0], [2, 4], [3, 5, 10, 12], [6], [7, 14]]
|
2D Euler diagrams | |||
---|---|---|---|
|
vidute (similar diagram with 3 pills) | ||
---|---|---|
The following example shows, that the approaches shown above are too rigidly geometric to be generally useful. ![]()
|
filtrates
[edit | edit source]Each of the 6 pairs is a 2-split (with all 4 quadrants). Only one of the 4 triples is a 3-split (with all 8 octants).
4 sets | |||
---|---|---|---|
![]() A |
![]() B |
![]() C |
![]() D |
6 pairs | |||||
---|---|---|---|---|---|
![]() A B |
![]() A C |
![]() A D |
![]() B C |
![]() B D |
![]() C D |
4 triples | |||||
---|---|---|---|---|---|
![]() A B C 7 cells |
![]() A B D 6 cells |
![]() A C D 6 cells |
![]() B C D 7 cells |
cells
[edit | edit source]middle | ||
---|---|---|
![]() |
![]() |
![]() |
![]() |
top or bottom (either blue or green) | ||
---|---|---|
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |