Abstract
A description is given of a new algorithm for solving the hidden surface (or line) problem, to more rapidly generate realistic images of 3-D scenes composed of polygons, and presents the development of theoretical foundations in the area as well as additional related algorithms. As in many applications the environment to be displayed consists of polygons many of whose relative geometric relations are static, the authors attempt to capitalize on this by preprocessing the environment's database so as to decrease the run-time computations required to generate a scene.
Original language | English (US) |
---|---|
Pages | 124-133 |
Number of pages | 10 |
Volume | 14 |
No | 3 |
Specialist publication | Comput Graphics (ACM) |
DOIs | |
State | Published - 1980 |
ASJC Scopus subject areas
- General Computer Science
- Computer Graphics and Computer-Aided Design