Paper by Erik D. Demaine

Reference:
Erik D. Demaine and Martin L. Demaine, “Fun with Fonts: Algorithmic Typography”, Theoretical Computer Science, volume 586, June 2015, pages 111–119.

Abstract:
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.

Comments:
This paper is available as arXiv:1404.1775 and from ScienceDirect.

Availability:
The paper is available in PDF (2520k).
See information on file formats.
[Google Scholar search]

Related papers:
Fonts_FUN2014 (Fun with Fonts: Algorithmic Typography)

Related webpages:
Mathematical and Puzzle Fonts/Typefaces


See also other papers by Erik Demaine.
These pages are generated automagically from a BibTeX file.
Last updated October 16, 2017 by Erik Demaine.