New, efficient solution minimizes run time. Approach based on approved theorem provides formal basis for assuring generality and rapid execution. Theorem does not directly address nuisance of square law growth. Analysis of algorithm shows it tends to avoid square-law growth, and rigorous testing verified algorithm tends to enjoy almost linear growth.
Hidden-Line Computer Code
NASA Tech Briefs ; 8 , 1
1984-04-01
Miscellaneous
No indication
English
Computer graphics hidden line removal algorithm
NTRS | 1982
NTRS | 1981
|NTIS | 1981
|