Dissection with the Fewest Pieces is Hard, Even to Approximate
Author(s)Manurangsi, Pasin; Bosboom, Jeffrey William; Demaine, Erik D; Demaine, Martin L; Lynch, Jayson R.; Rudoy, Mikhail; Yodpinyanee, Anak; ... Show more Show less
MetadataShow full item record
We prove that it is NP-hard to dissect one simple orthogonal polygon into another using a given number of pieces, as is approximating the fewest pieces to within a factor of 1+1/1080−ε .
DepartmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Discrete and Computational Geometry and Graphs
Springer International Publishing
Bosboom, Jeffrey, et al. “Dissection with the Fewest Pieces Is Hard, Even to Approximate.” JCDCGG 2015: Discrete and Computational Geometry and Graphs, 14-16 September, 2016, Kyoto, Japan, edited by Jin Akiyama et al., vol. 9943, Springer International Publishing, 2016, pp. 37–48.
Author's final manuscript