Open AccessThis article is
- freely available
Any Monotone Function Is Realized by Interlocked Polygons
Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology, MA 02139,USA
School of Information Science, Japan Advanced Institute of Science and Technology, Ishikawa 923-1292, Japan
* Author to whom correspondence should be addressed.
Received: 15 November 2011; in revised form: 13 March 2012 / Accepted: 14 March 2012 / Published: 19 March 2012
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 ƒ on n variables can be described by m = O(n) interlocked polygons. We also show that the decision problem that asks if given polygons are interlocked is PSPACE-complete.
Keywords: computational complexity; interlocked polygons; monotone boolean function; sliding block puzzle
Citations to this Article
Cite This Article
MDPI and ACS Style
Demaine, E.D.; Demaine, M.L.; Uehara, R. Any Monotone Function Is Realized by Interlocked Polygons. Algorithms 2012, 5, 148-157.
Demaine ED, Demaine ML, Uehara R. Any Monotone Function Is Realized by Interlocked Polygons. Algorithms. 2012; 5(1):148-157.
Demaine, Erik D.; Demaine, Martin L.; Uehara, Ryuhei. 2012. "Any Monotone Function Is Realized by Interlocked Polygons." Algorithms 5, no. 1: 148-157.