Affiliation:
1. Department of Computer Science, Stanford University, Stanford, California
Abstract
In many applications of three dimensional computer graphics, the appearance of the same scene must be computed repeatedly for many different positions of the viewer. This paper concerns a scheme for exploiting this property of an application for the purpose of improving the efficiency of the hidden surface computation. The scheme involves a kind of automatic programming: for each scene to be considered, a different special purpose program is automatically constructed. The special purpose program then takes the position of the viewer as input, and generates a suitable description of the scene with hidden surfaces removed as output. Since the special purpose program has a very limited task to perform - it is adapted to handling just one scene - it can be much faster than any general purpose algorithm would be for the same scene. The paper describes a method by which special purpose programs for hidden surface elimination can be constructed in a fully automatic manner. The method has been implemented, and results of experiments are given.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,General Computer Science
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. In-Depth Buffers;Proceedings of the ACM on Computer Graphics and Interactive Techniques;2018-07-25
2. Depth-presorted triangle lists;ACM Transactions on Graphics;2012-11
3. Visibility-ordering meshed polyhedra;ACM Transactions on Graphics;1992-04
4. Direct construction of the perspective projection aspect graph of convex polyhedra;Computer Vision, Graphics, and Image Processing;1990-07
5. Generating aspect graphs for nonconvex polyhedra;Computer-Aided Design;1990-06