scientific article; zbMATH DE number 841638

MaRDI QIDQ4863489zbMATH OpenFDO

Authors Vanessa Collazo, Arlene Correa, Pablo M. Salzberg

Publication date 6 February 1996

zbMATH Keywords

bi-remainder algorithmcomputer graphicsdrawing discrete linesEuclidean algorithmGCD problemintegral point on the line

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Number-theoretic algorithms; complexity (11Y16) Descriptive geometry (51N05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Geometric interpretation of the Euclidean algorithm and recognition of segments
• scientific article; zbMATH DE number 799776
• Euclid's Algorithm = Reverse Gaussian Elimination
• A NEW SYMMETRIC TWO-DIMENSIONAL ALGORITHM
• On the complexity of the extended Euclidean algorithm (extended abstract)

Cited in

(5)

• Geometric interpretation of the Euclidean algorithm and recognition of segments
• The polynomial Euclidean algorithm and the linear equation \(AX + BY = \gcd(A, B)\)
• Euclid's algorithm as a computational tool in the mathematics of antiquity.
• ON THE EUCLIDEAN ALGORITHM: RHYTHM WITHOUT RECURSION
• Dancing elves and a flower’s view of euclid’s algorithm

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4863489)