|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| R. Mahl, "Visible Surface Algorithms for Quadric Patches," IEEE Transactions on Computers, vol. 21, no. 1, pp. 1-4, January, 1972. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1972.223424, author = {R. Mahl}, title = {Visible Surface Algorithms for Quadric Patches}, journal ={IEEE Transactions on Computers}, volume = {21}, number = {1}, issn = {0018-9340}, year = {1972}, pages = {1-4}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1972.223424}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Visible Surface Algorithms for Quadric Patches IS - 1 SN - 0018-9340 SP1 EP4 EPD - 1-4 A1 - R. Mahl, PY - 1972 KW - Computer-aided design KW - curved surfaces KW - curvilinear surface representation KW - data structures KW - halftone pictures KW - hidden lines KW - visible surfaces. VL - 21 JA - IEEE Transactions on Computers ER - | |||
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.
Citation:
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.

