This Article 
 Bibliographic References 
 Add to: 
Visible Surface Algorithms for Quadric Patches
January 1972 (vol. 21 no. 1)
pp. 1-4
R. Mahl, Department of Data Processing, School of Mines
This paper describes two algorithms which find the visible portions of surfaces in a picture of a cluster of three-dimensional quadric patches. A quadric patch is a portion of quadric surface defined by a quadratic equation and by zero, one, or several quadratic inequalities. The picture is cut by parallel planes called scan planes. The visibility problem is solved in one scan plane at a time by making a "good guess" as to what is visible according to the visible portions found in the previous scan plane.
Index Terms:
Computer-aided design, curved surfaces, curvilinear surface representation, data structures, halftone pictures, hidden lines, visible surfaces.
R. Mahl, "Visible Surface Algorithms for Quadric Patches," IEEE Transactions on Computers, vol. 21, no. 1, pp. 1-4, Jan. 1972, doi:10.1109/T-C.1972.223424
Usage of this product signifies your acceptance of the Terms of Use.