Show simple item record

Dissection with the Fewest Pieces is Hard, Even to Approximate

dc.contributor.authorManurangsi, Pasin
dc.contributor.authorBosboom, Jeffrey William
dc.contributor.authorDemaine, Erik D
dc.contributor.authorDemaine, Martin L
dc.contributor.authorLynch, Jayson R.
dc.contributor.authorRudoy, Mikhail
dc.contributor.authorYodpinyanee, Anak
dc.date.accessioned2018-04-23T19:59:31Z
dc.date.available2018-04-23T19:59:31Z
dc.date.issued2016-11
dc.date.submitted2016-09
dc.identifier.isbn978-3-319-48531-7
dc.identifier.isbn978-3-319-48532-4
dc.identifier.issn0302-9743
dc.identifier.issn1611-3349
dc.identifier.urihttp://hdl.handle.net/1721.1/114897
dc.description.abstractWe 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−ε .en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CCF-1217423)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CCF-1065125)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CCF-1420692)en_US
dc.language.isoen_US
dc.publisherSpringer International Publishingen_US
dc.relation.isversionofhttps://doi.org/10.1007/978-3-319-48532-4_4en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceMIT Web Domainen_US
dc.titleDissection with the Fewest Pieces is Hard, Even to Approximateen_US
dc.typeArticleen_US
dc.identifier.citationBosboom, 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.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.mitauthorBosboom, Jeffrey William
dc.contributor.mitauthorDemaine, Erik D
dc.contributor.mitauthorDemaine, Martin L
dc.contributor.mitauthorLynch, Jayson R.
dc.contributor.mitauthorRudoy, Mikhail
dc.contributor.mitauthorYodpinyanee, Anak
dc.relation.journalDiscrete and Computational Geometry and Graphsen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dspace.orderedauthorsBosboom, Jeffrey; Demaine, Erik D.; Demaine, Martin L.; Lynch, Jayson; Manurangsi, Pasin; Rudoy, Mikhail; Yodpinyanee, Anaken_US
dspace.embargo.termsNen_US
dc.identifier.orcidhttps://orcid.org/0000-0002-8526-4085
dc.identifier.orcidhttps://orcid.org/0000-0003-3803-5703
dc.identifier.orcidhttps://orcid.org/0000-0002-3466-6543
mit.licenseOPEN_ACCESS_POLICYen_US


Files in this item

Thumbnail
Name:
Dissection with the fewest.pdf
Size:
256.5Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record