Dissection with the Fewest Pieces is Hard, Even to Approximate
Name
Dissection with the fewest.pdf
Size
256.51 KB
Format
Adobe PDF
Checksum (MD5)
0d4cfbb25574518f6e5bd496ab2f12c5
Author(s)
Manurangsi, Pasin
Bosboom, Jeffrey William
Demaine, Erik D
Demaine, Martin L
Lynch, Jayson R.
Rudoy, Mikhail
Yodpinyanee, Anak
Date Issued
November 2016
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
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−ε .
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-319-48532-4_4
