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.

BibTeX

@Article{Fonts_TCS,
  AUTHOR        = {Erik D. Demaine and Martin L. Demaine},
  TITLE         = {Fun with Fonts: Algorithmic Typography},
  JOURNAL       = {Theoretical Computer Science},
  journalurl    = {https://www.journals.elsevier.com/theoretical-computer-science},
  VOLUME        = 586,
  MONTH         = {June},
  YEAR          = 2015,
  PAGES         = {111--119},

  webpages      = {fonts},
  papers        = {Fonts_FUN2014},
  replaces      = {Fonts_FUN2014},
  category      = {art},
  doi           = {https://dx.doi.org/10.1016/J.TCS.2015.01.054},
  dblp          = {https://dblp.org/rec/journals/tcs/DemaineD15},
  comments      = {This paper is available as
                   <A HREF="http://arXiv.org/abs/1404.1775">arXiv:1404.1775</A>
                   and from <A HREF="http://dx.doi.org/10.1016/j.tcs.2015.01.054">ScienceDirect</A>.},
}

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