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.; ... Show more
Thumbnail
DownloadDissection with the fewest.pdf (256.5Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
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−ε .
Date issued
2016-11
URI
http://hdl.handle.net/1721.1/114897
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
Discrete and Computational Geometry and Graphs
Publisher
Springer International Publishing
Citation
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.
Version: Author's final manuscript
ISBN
978-3-319-48531-7
978-3-319-48532-4
ISSN
0302-9743
1611-3349
Collections