Any Monotone Boolean Function Can Be Realized by Interlocked Polygons
We show how to construct interlocked collections of simple polygons in the plane that fall apart upon removing certain combinations of pieces. Precisely, interior-disjoint simple planar polygons are interlocked if no subset can be separated arbitrarily far from the rest, moving each polygon as...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
University of Manitoba
2011
|
| Online Access: | http://hdl.handle.net/1721.1/62257 https://orcid.org/0000-0003-3803-5703 |