Skip Navigation

The Computer Journal 1990 33(5):408-411; doi:10.1093/comjnl/33.5.408
© 1990 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 (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Neal, L. R.
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?

Yet More Circle Generators

L. R. Neal * and M. L. V. Pitteway

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

This paper presents efficient algorithms for generating points on the circumference of a circle, based on extensions to an ellipse-drawing algorithm attributed to Minsky. The algorithms have direct use in the control of the path of machine tools, particularly through their acceleration and deceleration phases.

Received February 1990.

* To whom correspondence should be addressed.

§ Department of Computer Science, Brunel University, Uxbridge, Middlesex, 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.