Abstract
All the three-dimensional diagrams drawn so far have been ‘wire figures’, pictures of objects in which all edges and vertices may be seen. If an object is solid, then naturally the edges and vertices behind the volume of the object would be invisible to an observer, for example, the dashed lines in figure 8.1. So we have to produce a Hidden Line Algorithm that will draw only the visible line segments on a solid object or set of objects. We shall assume that all vertices are the end points of line segments.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Copyright information
© 1981 Ian O. Angell
About this chapter
Cite this chapter
Angell, I.O. (1981). Hidden Line Algorithms. In: A Practical Introduction to Computer Graphics. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-16592-6_8
Download citation
DOI: https://doi.org/10.1007/978-1-349-16592-6_8
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-31083-0
Online ISBN: 978-1-349-16592-6
eBook Packages: Computer ScienceComputer Science (R0)