Skip to main navigation Skip to search Skip to main content

A study of Jacobi-Perron boundary words for the generation of discrete planes

  • Université Paris Diderot
  • Université Savoie Mont Blanc

Research output: Contribution to journal › Journal Article › peer-review

3 Citations (Scopus)

Abstract

The construction of a Sturmian word, and thus of a discrete line, from a continued fraction development generalizes to higher dimensions. Given any vector v ε R3, a list of 6-connected points approximating the line defined by v may be obtained via a generalized continued fraction algorithm. By duality, a discrete plane with normal vector v can also be generated using a related technique. We focus on such discrete planes, more precisely on the finite patterns generated at each step of the process. We show that the choice of the Jacobi-Perron algorithm as a higher dimension generalization of Euclid's algorithm together with the specific substitutions deduced from it allows us to guaranty the simple connectedness of those patterns.

Original languageEnglish
Pages (from-to)118-142
Number of pages25
JournalTheoretical Computer Science
Volume502
DOIs
Publication statusPublished - 2 Sept 2013

Keywords

  • Discrete geometry
  • Discrete plane
  • Multidimensional continued fractions
  • Substitutions

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'A study of Jacobi-Perron boundary words for the generation of discrete planes'. These topics are generated from the title and abstract of the publication. Together, they form a unique fingerprint.

Cite this