Notice
This is not the latest version of this item. The latest version can be found at:https://dspace.mit.edu/handle/1721.1/134491.2
Fun with fonts: Algorithmic typography
dc.contributor.author | Demaine, Erik D | |
dc.contributor.author | Demaine, Martin L | |
dc.date.accessioned | 2021-10-27T20:05:15Z | |
dc.date.available | 2021-10-27T20:05:15Z | |
dc.date.issued | 2015 | |
dc.identifier.uri | https://hdl.handle.net/1721.1/134491 | |
dc.description.abstract | © 2015 . Over the past decade, we have designed six typefaces based on mathematical theorems and open problems, specifically computational geometry. These typefaces expose the general public in a unique way to intriguing results and hard problems in hinged dissections, geometric tours, origami design, computer-aided glass design, physical simulation, and protein folding. In particular, most of these typefaces include puzzle fonts, where reading the intended message requires solving a series of puzzles which illustrate the challenge of the underlying algorithmic problem. | |
dc.language.iso | en | |
dc.publisher | Elsevier BV | |
dc.relation.isversionof | 10.1016/J.TCS.2015.01.054 | |
dc.rights | Creative Commons Attribution-NonCommercial-NoDerivs License | |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | |
dc.source | arXiv | |
dc.title | Fun with fonts: Algorithmic typography | |
dc.type | Article | |
dc.relation.journal | Theoretical Computer Science | |
dc.eprint.version | Original manuscript | |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | |
eprint.status | http://purl.org/eprint/status/NonPeerReviewed | |
dc.date.updated | 2019-06-18T12:16:43Z | |
dspace.orderedauthors | Demaine, ED; Demaine, ML | |
dspace.date.submission | 2019-06-18T12:16:45Z | |
mit.journal.volume | 586 | |
mit.metadata.status | Authority Work and Publication Information Needed |