Skip Navigation

The Computer Journal 1987 30(2):168-175; doi:10.1093/comjnl/30.2.168
© 1987 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (6)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Castle, C. M. A.
Right arrow Articles by Pitteway, M. L. V.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An Efficient Structural Technique for Encoding ‘Best-fit’ Straight Lines

C. M. A. Castle * and M. L. V. Pitteway *

Computer Science Department, Brunel University, Uxbridge UB8 3PH, UK

A structural algorithm is proposed which used Euclid's algorithm to control two symmetric production rules which can construct the ‘best-fit’ incremental line. The output is identical to that produced by Bresenham's algorithm but is, in general, produced in fewer subtract operations. The correctness of the algorithm is established, and a formula conjectured for the behaviour of the subtractive version of Euclid's algorithm.

Received August 1985.

* Computer Science Department, Brunel University, Uxbridge UB8 3PH


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.