Geometric interpretation of the Euclidean algorithm and recognition of segments

DOI10.1016/0304-3975(93)90121-9zbMath0774.68103MaRDI QIDQ1261469

K. Appert

Publication date: 11 November 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90121-9

zbMATH Keywords

straight lines; geometrical transformations

Mathematics Subject Classification ID

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Related Items

Generation and Recognition of Digital Planes Using Multi-dimensional Continued Fractions, Combinatorial generation of planar sets, Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line, A study of Jacobi-Perron boundary words for the generation of discrete planes, Generation and recognition of digital planes using multi-dimensional continued fractions, Run-hierarchical structure of digital lines with irrational slopes in terms of continued fractions and the Gauss map, Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
• Discrete Representation of Straight Lines
• Spirograph Theory: A Framework for Calculations on Digitized Straight Lines
• On the Chain Code of a Line
• Digital Straight Line Segments
• Internal set theory: A new approach to nonstandard analysis
• Sequences with minimal block growth
• Wave-guide propagation inside elongated irregularities in the ionosphere