An Efficient Structural Technique for Encoding 'Best-fit' Straight Lines

DOI10.1093/COMJNL/30.2.168zbMATH Open0653.68120OpenAlexW1977964727MaRDI QIDQ3799673FDOQ3799673

Authors: C. M. A. Castle, M. L. V. Pitteway 

Publication date: 1987

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/30.2.168

Recommendations

• Geometric interpretation of the Euclidean algorithm and recognition of segments
• A simple algorithm for digital line recognition in the general case
• Incremental linear interpolation
• A new characterization of digital lines by least square fits
• An integral linear interpolation approach to the design of incremental line algorithms

zbMATH Keywords

Euclid's algorithmline drawing algorithm

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Radix representation; digital problems (11A63) Algorithms in computer science (68W99)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: An Efficient Structural Technique for Encoding 'Best-fit' Straight Lines

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