Chapter

Discrete Geometry for Computer Imagery

Volume 6607 of the series Lecture Notes in Computer Science pp 47-58

An Arithmetic and Combinatorial Approach to Three-Dimensional Discrete Lines

  • Valérie BerthéAffiliated withLaboratoire d’Informatique Algorithmique : Fondements et Applications, Université Paris Diderot
  • , Sébastien LabbéAffiliated withLaboratoire de Combinatoire et d’Informatique Mathématique, Université du Québec à Montréal

* Final gross prices may vary according to local VAT.

Get Access

Abstract

The aim of this paper is to discuss from an arithmetic and combinatorial viewpoint a simple algorithmic method of generation of discrete segments in the three-dimensional space. We consider discrete segments that connect the origin to a given point (u 1,u 2,u 3) with coprime nonnegative integer coordinates. This generation method is based on generalized three-dimensional Euclid’s algorithms acting on the triple (u 1,u 2,u 3). We associate with the steps of the algorithm substitutions, that is, rules that replace letters by words, which allow us to generate the Freeman coding of a discrete segment. We introduce a dual viewpoint on these objects in order to measure the quality of approximation of these discrete segments with respect to the corresponding Euclidean segment. This viewpoint allows us to relate our discrete segments to finite patches that generate arithmetic discrete planes in a periodic way.

Keywords

Discrete Segments Discrete Lines Christoffel words multi-dimensional Euclid’s algorithms multi-dimensional continued fractions substitutions