Revision history for BP1261
|
Displaying 1-17 of 17 results found.
|
page 1
|
|
Edits shown per page: 25.
|
|
|
|
|
| |
| |
|
|
+DATA
|
EX10165 |
|
|
|
|
| |
| |
|
|
COMMENTS
|
All left-sorted examples have 2^n distinct white regions (counting the background), where n is the number of shapes in the image. |
|
|
|
|
| |
| |
|
|
CROSSREFS
|
Similar solution to BP1262, except there overlaps do not have to be unique. |
|
|
|
|
| |
| |
|
|
CROSSREFS
|
Similar solution to BP1261, except there overlaps do not have to be unique. |
|
|
|
|
| |
| |
|
|
+DATA
|
EX10073 |
|
|
|
|
|
-DATA
|
EX10074 |
|
|
|
|
|
REMOVE
|
EX10072 |
|
|
|
|
| |
| |
|
|
-DATA
|
EX10072 |
|
|
|
|
| |
| |
|
|
+DATA
|
EX10071 |
|
|
|
|
|
REMOVE
|
EX10069 |
|
|
|
|
| |
| |
|
|
+DATA
|
EX10069 |
|
|
|
|
|
-DATA
|
EX10070 |
|
|
|
|
| |
| |
|
|
COMMENTS
|
All left-sorted examples have 2^n distinct white regions, where n is the number of shapes in the image. |
|
|
|
|
| |
| |
|
|
NAME
|
Exactly one connected white region for each possible way shapes can overlap vs. not so.
|
|
|
|
|
| |
| |
|
|
NAME
|
Exactly one connected white region for each possible overlap of shapes vs. not so.
|
|
REFERENCE
|
https://en.wikipedia.org/wiki/Venn_diagram |
|
AUTHOR
|
Leo Crabbe |
|
|
|
|
|
+DATA
|
EX8381 EX10064 EX10065 EX10066 |
|
|
|
|
|
-DATA
|
EX8379 EX8385 EX10067 EX10068 |
|
|
|