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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literature
Boutland J.: Surface Drawing Made Simple. Computer Aided Design 11 (1) January 1979. pp. 19–22
Bresenham J.E.: Algorithm for Computer Control of Digital Plotter, IBM Syst. J. 4 (1) 1965, pp. 25–30
Pitteway M., Watkinson D.: Bresenham“s Algorithm with Grey Scale, Comm. of ACM 23 (11), November 1980, pp. 625–626
Skala V.: Hidden-Line Processor, CSTR/29, Computer Science Dept., Brunel University, Uxbridge, Middlesex, 1984
Sowerbutts W.T.: A Surface-Plotting Program Suitable for Microcomputers, Computer Aided Design 15 (6), November 1983, pp. 324–327
Watkins S.L.: Masked Three-Dimensional Plot Program with rotation. Comm. of ACM 17 (9), September 1974, pp. 520–523
Williamson H.: Hidden-Line Plotting Program. Comm. of ACM 15 (2), February 1972, pp. 100–103
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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