uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Digital lines with irrational slopes
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics. (digital geometri)
2007 (English)In: Theoretical Computer Science, ISSN 0304-3975, Vol. 377, no 1-3, 157-169 p.Article in journal (Refereed) Published
Abstract [en]

How to construct a digitization of a straight line and how to be able to recognize a straight line in a set of pixels are very important topics in computer graphics. The aim of the present paper is to give a mathematically exact and consistent description of digital straight lines according to Rosenfeld's definition. The digitizations of lines with slopes 0 < a < 1, where a is irrational, are considered. We formulate a definition of digitization runs, and formulate and prove theorems containing necessary and sufficient conditions for digital straightness. The proof was successfully constructed using only methods of elementary mathematics. The developed and proved theory can be used in research into the theory of digital lines, their symmetries, translations, etc.

Place, publisher, year, edition, pages
2007. Vol. 377, no 1-3, 157-169 p.
Keyword [en]
Digital geometry, Theory of digital lines, Irrational slope, Continued fractions
National Category
URN: urn:nbn:se:uu:diva-12821DOI: 10.1016/j.tcs.2007.02.037ISI: 000247279200013OAI: oai:DiVA.org:uu-12821DiVA: diva2:40590
Available from: 2008-01-16 Created: 2008-01-16 Last updated: 2011-02-07Bibliographically approved
In thesis
1. Digital lines, Sturmian words, and continued fractions
Open this publication in new window or tab >>Digital lines, Sturmian words, and continued fractions
2009 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

In this thesis we present and solve selected problems arising from digital geometry and combinatorics on words. We consider digital straight lines and, equivalently, upper mechanical words with positive irrational slopes a<1 and intercept 0. We formulate a continued fraction (CF) based description of their run-hierarchical structure.

Paper I gives a theoretical basis for the CF-description of digital lines. We define for each irrational positive slope less than 1 a sequence of digitization parameters which fully specifies the run-hierarchical construction.

In Paper II we use the digitization parameters in order to get a description of runs using only integers. We show that the CF-elements of the slopes contain the complete information about the run-hierarchical structure of the line. The index jump function introduced by the author indicates for each positive integer k the index of the CF-element which determines the shape of the digitization runs on level k.

In Paper III we present the results for upper mechanical words and compare our CF-based formula with two well-known methods, one of which was formulated by Johann III Bernoulli and proven by Markov, while the second one is known as the standard sequences method. Due to the special treatment of some CF-elements equal to 1 (essential 1's in Paper IV), our method is currently the only one which reflects the run-hierarchical structure of upper mechanical words by analogy to digital lines.

In Paper IV we define two equivalence relations on the set of all digital lines with positive irrational slopes a<1. One of them groups into classes all the lines with the same run length on all digitization levels, the second one groups the lines according to the run construction in terms of long and short runs on all levels. We analyse the equivalence classes with respect to minimal and maximal elements. In Paper V we take another look at the equivalence relation defined by run construction, this time independently of the context, which makes the results more general.

In Paper VI we define a run-construction encoding operator, by analogy with the well-known run-length encoding operator. We formulate and present a proof of a fixed-point theorem for Sturmian words. We show that in each equivalence class under the relation based on run length on all digitization levels (as defined in Paper IV), there exists exactly one fixed point of the run-construction encoding operator.

Place, publisher, year, edition, pages
Uppsala: Matematiska institutionen, 2009. 59 p.
Uppsala Dissertations in Mathematics, ISSN 1401-2049 ; 65
digital geometry, digital line, hierarchy of runs, combinatorics on words, Sturmian word, upper mechanical word, characteristic word, irrational slope, continued fraction, Gauss map, fixed point
National Category
Discrete Mathematics
Research subject
urn:nbn:se:uu:diva-107274 (URN)978-91-506-2090-0 (ISBN)
Public defence
2009-09-25, Polhemsalen, Lägerhyddsvägen 1, Uppsala, Ångström Laboratory, 10:15 (English)
Available from: 2009-09-04 Created: 2009-08-03 Last updated: 2009-09-04Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full texthttp://dx.doi.org/10.1016/j.tcs.2007.02.037
By organisation
Department of Mathematics
In the same journal
Theoretical Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 221 hits
ReferencesLink to record
Permanent link

Direct link