Skip to main content

An Interesting Modification to the Bresenham Algorithm for Hidden-Line Solution

  • Conference paper
Fundamental Algorithms for Computer Graphics

Part of the book series: NATO ASI Series ((SSE,volume 17))

Abstract

The solution of many engineering problems have as a result functions of two variables, that can be given either by an explicit function description, or by a table of the function values. The functions, that can be given either by an explicit function description, or by a table of the function values. The functions have been usually plotted with respect to visibility. The subprograms for plotting the functions of two variables were not so simple ([6]–[7]) although visibility may be achieved by the relatively simple algorithm at the physical level of the drawing, if we assume raster graphics devices are used. The Bresenham algorithm for drawing line segments can be modified in order to enable the drawing of explicit functions of two variables with respect to the visibility.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

Literature

  1. Boutland J.: Surface Drawing Made Simple. Computer Aided Design 11 (1) January 1979. pp. 19–22

    Article  Google Scholar 

  2. Bresenham J.E.: Algorithm for Computer Control of Digital Plotter, IBM Syst. J. 4 (1) 1965, pp. 25–30

    Article  Google Scholar 

  3. Pitteway M., Watkinson D.: Bresenham“s Algorithm with Grey Scale, Comm. of ACM 23 (11), November 1980, pp. 625–626

    Article  Google Scholar 

  4. Skala V.: Hidden-Line Processor, CSTR/29, Computer Science Dept., Brunel University, Uxbridge, Middlesex, 1984

    Google Scholar 

  5. Sowerbutts W.T.: A Surface-Plotting Program Suitable for Microcomputers, Computer Aided Design 15 (6), November 1983, pp. 324–327

    Article  Google Scholar 

  6. Watkins S.L.: Masked Three-Dimensional Plot Program with rotation. Comm. of ACM 17 (9), September 1974, pp. 520–523

    Article  Google Scholar 

  7. Williamson H.: Hidden-Line Plotting Program. Comm. of ACM 15 (2), February 1972, pp. 100–103

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Skala, V. (1985). An Interesting Modification to the Bresenham Algorithm for Hidden-Line Solution. In: Earnshaw, R.A. (eds) Fundamental Algorithms for Computer Graphics. NATO ASI Series, vol 17. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-84574-1_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-84574-1_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54397-8

  • Online ISBN: 978-3-642-84574-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics