Abstract
In general the objects that are manipulated in three-dimensional graphics can be classified into two groups: wire frame and true solids. In the wire frame group the objects are described in terms of sets of lines, and in the solid group the objects would be described in terms of surfaces with well-defined properties. While both groups of objects are quite distinct visually, they do share common problems: the removal of unwanted lines and/or surfaces respectively.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References and Bibliography
Angell, I.O.: A Practical Guide to Computer Graphics ( Macmillan Press, London, 1981 )
Avis, D. and Toussaint, G.: ‘An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge’, IEEE Transactions on Computers, C-30 (12) (1981), 910–14
Blinn, J.F. et al: ‘Scan Line Methods for Displaying Parametrically Defined Surfaces’, Communications of the ACM, 23 (1) (1980), 23–4
Blinn, J.F. and Newell, M.E.: ‘Texture and Reflection in Computer Generated Images’, Communications of the ACM, 19 (10) (1976), 542–7
Boissonnat, J.D.: ‘Geometric Structures for Three-dimensional Shape Representation’, ACM Transactions on Graphics, 3 (4) (1984), 266–86
Crow, F.C.: ‘Shadow Algorithms for Computer Graphics’, Computer Graphics, 11 (2) (1977), 242–8
Franklin, W.R.: ‘A Linear Time Exact Hidden Surface Algorithm’, Computer Graphics (ACM SIGGRAPH), 14, (3) (1980), 117–123
Foley, J.D. and Van Dam, A.: Fundamentals of Interactive Computer Graphics (Addison-Wesley, Reading, Massachusetts, 1982 )
Galimberti, R. and Montanari, U.: (1969) ‘An Algorithm for Hidden Line Elimination’, Communications of the ACM, 12 (4) (1969)
Giloi, W.K.: Interactive Computer Graphics: Data Structures, Algorithms, Languages (Prentice-Hall, Englewood Cliffs, New Jersey, 1978 )
Heckbert, P.S. and Hanrahan, P.: ‘Beam Tracing Polygonal Objects’, Computer Graphics, 18 (3) (1984)
Requicha, A.A.G. and Voelcker, H.B.: ‘Solid Modelling: A Historical Summary and Contemporary Assessment’, IEEE Computer Graphics Applications, 2 (2) (1982), 9–24
Rogers, D.A. and Adams, J.A.: Mathematical Elements for Computer Graphics (McGraw-Hill, Maidenhead, Berkshire, 1976 )
Sutherland, I.E., Sproull, R.F. and Schumacher, R.A.: ‘A Characterization of Ten Hidden Surface Algorithms’, Computing Surveys, 6 (1) (1974) 1–55
Weiler, K. and Atherton, P.: ‘Hidden Surface Removal Using Polygon Area Sorting’, Computer Graphics, 11 (2) (1977), 214–22
Whitted, T.: ‘An Improved Illumination Model for Shaded Display’, Communications of the ACM, 23 (6) (1980) 343–9
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Robert Ransom and Raymond J. Matela
About this chapter
Cite this chapter
Ransom, R., Matela, R.J. (1986). Hidden Lines and Hidden Surfaces. In: Computer Graphics in Biology. Computers in Biology Series. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-1490-5_6
Download citation
DOI: https://doi.org/10.1007/978-1-4684-1490-5_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-1492-9
Online ISBN: 978-1-4684-1490-5
eBook Packages: Springer Book Archive