Show simple item record

dc.contributor.authorDemaine, Erik
dc.contributor.authorFekete, S?ndor
dc.contributor.authorKeldenich, Phillip
dc.contributor.authorKrupke, Dominik
dc.contributor.authorMitchell, Joseph
dc.date.accessioned2022-11-15T19:12:13Z
dc.date.available2022-11-15T19:12:13Z
dc.date.issued2022-03-04
dc.identifier.issn1084-6654
dc.identifier.urihttps://hdl.handle.net/1721.1/146480
dc.publisherACMen_US
dc.relation.isversionofhttps://doi.org/10.1145/3504000en_US
dc.rightsCreative Commons Attribution 4.0 International licenseen_US
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/en_US
dc.sourceACMen_US
dc.titleArea-Optimal Simple Polygonalizations: The CG Challenge 2019en_US
dc.typeArticleen_US
dc.identifier.citationDemaine, Erik, Fekete, S?ndor, Keldenich, Phillip, Krupke, Dominik and Mitchell, Joseph. 2022. "Area-Optimal Simple Polygonalizations: The CG Challenge 2019." Journal of Experimental Algorithmics.
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
dc.relation.journalJournal of Experimental Algorithmicsen_US
dc.identifier.mitlicensePUBLISHER_CC
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dc.date.updated2022-11-03T12:37:03Z
dc.language.rfc3066en
dc.rights.holderThe author(s)
dspace.date.submission2022-11-03T12:37:03Z
mit.licensePUBLISHER_CC
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record