Zobrazeno 1 - 10
of 2 913
pro vyhledávání: '"Demaine, A."'
Autor:
Akitaya, Hugo A., Biniaz, Ahmad, Demaine, Erik D., Kleist, Linda, Stock, Frederick, Tóth, Csaba D.
For a set of red and blue points in the plane, a minimum bichromatic spanning tree (MinBST) is a shortest spanning tree of the points such that every edge has a red and a blue endpoint. A MinBST can be computed in $O(n\log n)$ time where $n$ is the n
Externí odkaz:
http://arxiv.org/abs/2409.11614
Autor:
Demaine, Erik D., Langerman, Stefan
We prove that the following problem is co-RE-complete and thus undecidable: given three simple polygons, is there a tiling of the plane where every tile is an isometry of one of the three polygons (either allowing or forbidding reflections)? This res
Externí odkaz:
http://arxiv.org/abs/2409.11582
Autor:
MIT CompGeom Group, Akitaya, Hugo A., Demaine, Erik D., Hesterberg, Adam, Lubiw, Anna, Lynch, Jayson, O'Rourke, Joseph, Stock, Frederick, Tkadlec, Josef
A polyiamond is a polygon composed of unit equilateral triangles, and a generalized deltahedron is a convex polyhedron whose every face is a convex polyiamond. We study a variant where one face may be an exception. For a convex polygon P, if there is
Externí odkaz:
http://arxiv.org/abs/2408.04687
Autor:
MIT Hardness Group, Anchaleenukoon, Nithid, Dang, Alex, Demaine, Erik D., Ji, Kaylee, Saengrungkongka, Pitchayut
Given a chain of $HW$ cubes where each cube is marked "turn $90^\circ$" or "go straight", when can it fold into a $1 \times H \times W$ rectangular box? We prove several variants of this (still) open problem NP-hard: (1) allowing some cubes to be wil
Externí odkaz:
http://arxiv.org/abs/2407.10323
How should we thread a single string through a set of tubes so that pulling the string taut self-assembles the tubes into a desired graph? While prior work [ITCS 2024] solves this problem with the goal of minimizing the length of string, we study her
Externí odkaz:
http://arxiv.org/abs/2405.17953
Autor:
Team, MIT--NASA Space Robots, Brunner, Josh, Cheung, Kenneth C., Demaine, Erik D., Diomidova, Jenny, Gregg, Christine, Hendrickson, Della H., Kostitsyna, Irina
We introduce and analyze a model for self-reconfigurable robots made up of unit-cube modules. Compared to past models, our model aims to newly capture two important practical aspects of real-world robots. First, modules often do not occupy an exact u
Externí odkaz:
http://arxiv.org/abs/2405.15724
Autor:
MIT Hardness Group, Ani, Hayashi, Demaine, Erik D., Hall, Holden, Ruiz, Ricardo, Venkat, Naveen
We prove RE-completeness (and thus undecidability) of several 2D games in the Super Mario Bros. platform video game series: the New Super Mario Bros. series (original, Wii, U, and 2), and both Super Mario Maker games in all five game styles (Super Ma
Externí odkaz:
http://arxiv.org/abs/2405.10546
Autor:
MIT Hardness Group, Brunner, Josh, Hendrickson, Della, Chung, Lily, Demaine, Erik D., Tockman, Andy
We prove that Hamiltonicity in maximum-degree-3 grid graphs (directed or undirected) is ASP-complete, i.e., it has a parsimonious reduction from every NP search problem (including a polynomial-time bijection between solutions). As a consequence, give
Externí odkaz:
http://arxiv.org/abs/2405.08377
We prove NP-hardness and #P-hardness of Tetris clearing (clearing an initial board using a given sequence of pieces) with the Super Rotation System (SRS), even when the pieces are limited to any two of the seven Tetris piece types. This result is the
Externí odkaz:
http://arxiv.org/abs/2404.10712
We prove PSPACE-hardness for fifteen games in the Super Mario Bros. 2D platforming video game series. Previously, only the original Super Mario Bros. was known to be PSPACE-hard (FUN 2016), though several of the games we study were known to be NP-har
Externí odkaz:
http://arxiv.org/abs/2404.10380