The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1985 vol.5)
pp: 37-50
Carlo Sequin , University of California, Berkeley
Paul Wensley , University of California, Berkeley
ABSTRACT
One scan-line sweep across a scene detects and reconstructs the visible portions of all polygons for fast rendering on high-resolution devices.
INDEX TERMS
null
CITATION
Carlo Sequin, Paul Wensley, "Visible Feature Return at Object Resolution", IEEE Computer Graphics and Applications, vol.5, no. 5, pp. 37-50, May 1985, doi:10.1109/MCG.1985.276392
REFERENCES
1. I. E.Sutherland, R. F.Sproull, and R. A.Schumacker, “A Characterization of Ten Hidden Surface Algorithms,” Computing Surveys Vol. 6, No. 1, pp. 1-55 Mar. 1974
2. C. H.Séquin, M. G.Segal, and P. R.Wensley, “UNIGRAFIX 2.0 User's Manual and Tutorial,” , University of California Berkeley Dec. 1983
3. C. H.Séquin and P. S.Strauss, “UNIGRAFIX,” Proc. 20th Design Automation Conf. June 1983pp. 374-381
4. P.Atherton, K.Weiler, and D.Greenberg, “Polygon Shadow Generation,” Computer Graphics (Proc. Siggraph 78) Aug. 1978 Vol. 12, No. 3, pp. 275-281
5. S.Sechrest and D. P.Greenberg, “A Visible Polygon Reconstruction Algorithm,” Computer Graphics (Proc. Siggraph 81) Aug. 1981 Vol. 15, No. 3, pp. 17-27
6. G.Hamlin and C. W.Gear, “Raster-Scan Hidden Surface Algorithm Techniques,” Computer Graphics (Proc. Siggraph 77) Summer 1977 Vol. 11, No. 2, pp. 206-213
7. C. H.Séquin, “Creative Geometric Modeling with UNIGRAFIX,” Dec. 1983
8. M. G.Segal, “Partitioning Polyhedral Objects into Non-Intersecting Parts,” master's report (in preparation)
9. P. R.Wensley, “Hidden Feature Elimination and Visible Polygon Return in UNIGRAFIX 2,” May 1984
10. W. M.Newman and R. F.Sproull, Principles of Interactive Computer Graphics , McGraw-Hill 1979pp. 499
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool