Paper by Erik D. Demaine

Reference:
Erik D. Demaine and Martin L. Demaine, “Fun with Fonts: Algorithmic Typography”, in Proceedings of the 7th International Conference on Fun with Algorithms (FUN 2014), Lipari Island, Italy, July 1–3, 2014, pages 16–27.

Abstract:
Over the past decade, we have designed five 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, 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.

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

Related papers:
Fonts_TCS (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 July 21, 2017 by Erik Demaine.