Name
Abstract | ||
|---|---|---|
Suppose there is a collection of n simple polygons in the plane, none of which overlap each other. The polygons are interlocked if no subset can be separated arbitrarily far from the rest. It is natural to ask the characterization of the subsets that makes the set of interlocked polygons free (not interlocked). This abstracts the essence of a kind of sliding block puzzle. We show that any monotone Boolean function f on n variables can be described by in = O(n) interlocked polygons. We also show that the decision problem that asks if given polygons are interlocked is PSPACE-complete. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.3390/a5010148 | ALGORITHMS |
Keywords | Field | DocType |
computational complexity, interlocked polygons, monotone boolean function, sliding block puzzle | Discrete mathematics,Monotonic function,Polygon,Decision problem,Combinatorics,Boolean operations on polygons,Smoothing group,Point in polygon,Monotone boolean function,Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
5 | 1 | 1999-4893 |
Citations | PageRank | References |
1 | 0.39 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Erik D. Demaine | 1 | 4624 | 388.59 |
| Martin L. Demaine | 2 | 592 | 84.37 |
| Ryuhei Uehara | 3 | 528 | 75.38 |