Geometric interpretation of the Euclidean algorithm and recognition of segments

DOI10.1016/0304-3975(93)90121-9zbMath0774.68103OpenAlexW143258193MaRDI 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 linesgeometrical transformations

Mathematics Subject Classification ID

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

Related Items (7)

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 ⋮ 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 ⋮ Combinatorial generation of planar sets ⋮ Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity ⋮ Generation and Recognition of Digital Planes Using Multi-dimensional Continued Fractions

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

This page was built for publication: Geometric interpretation of the Euclidean algorithm and recognition of segments