ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
On visible surface generation by a priori tree structures
Full text PdfPdf (639 KB)
Source ACM SIGGRAPH Computer Graphics archive
Volume 14 ,  Issue 3  (July 1980) table of contents
Pages: 124 - 133  
Year of Publication: 1980
ISSN:0097-8930
Also published in ...
Authors
Henry Fuchs  University of North Carolina at Chapel Hill
Zvi M. Kedem  The University of Texas at Dallas
Bruce F. Naylor  The University of Texas at Dallas
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 18,   Downloads (12 Months): 140,   Citation Count: 141
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/965105.807481
What is a DOI?

Warning: The download time has expired please click on the item to try again.


ABSTRACT

This paper describes 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, we attempt to capitalize on this by preprocessing the environment's database so as to decrease the run-time computations required to generate a scene. This preprocessing is based on generating a “binary space partitioning” tree whose in order traversal of visibility priority at run-time will produce a linear order, dependent upon the viewing position, on (parts of) the polygons, which can then be used to easily solve the hidden surface problem. In the application where the entire environment is static with only the viewing-position changing, as is common in simulation, the results presented will be sufficient to solve completely the hidden surface problem.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Berman, G. and Fryer, K.D. Introduction to Combinatorics, (1972) Academic Press.
2
 
3
Schumaker, R.A., Brand, P., Gilliland, M. and Sharp, W. "Study for Applying Computer-Generated Images to Visual Simulation," AFHRL-TR-69-14, U.S. Air Force Human Resources Laboratory (1969)
4

CITED BY  141

Collaborative Colleagues:
Henry Fuchs: colleagues
Zvi M. Kedem: colleagues
Bruce F. Naylor: colleagues