Visible Surface Algorithms for Quadric Patches
- 1 January 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-21 (1), 1-4
- https://doi.org/10.1109/t-c.1972.223424
Abstract
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.Keywords
This publication has 3 references indexed in Scilit:
- A procedure for generation of three-dimensional half-toned computer graphics presentationsCommunications of the ACM, 1970
- SURFACES FOR COMPUTER-AIDED DESIGN OF SPACE FORMSPublished by Defense Technical Information Center (DTIC) ,1967
- BE VISION, A Package of IBM 7090 FORTRAN Programs to Draw Orthographic Views of Combinations of Plane and Quadric SurfacesJournal of the ACM, 1966