Skip to main content

A Collection of Nice Algorithms

  • Chapter
Book cover What Computing Is All About

Part of the book series: Text and Monographs in Computer Science ((MCS))

  • 162 Accesses

Abstract

We develop an algorithm for drawing a straight line on a raster. The algorithm is known as Bresenham’s algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag New York, Inc.

About this chapter

Cite this chapter

van de Snepscheut, J.L.A. (1993). A Collection of Nice Algorithms. In: What Computing Is All About. Text and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2710-6_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-2710-6_12

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-7639-5

  • Online ISBN: 978-1-4612-2710-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics