ACM Transactions on Graphics · 1982 · 49 citations · 6 references
ArchitectureVisualizationGrid ComputingProjection MappingScientific VisualizationHidden Line RepresentationLine ProjectionHidden Line EliminationHidden Line ProjectionHidden Lines
The hidden line and hidden surface problems are often simpler when restricted to special classes of objects. An example is the class of grid surfaces, that is, graphs of bivariate functions represented by their values on a set of grid points. Projected grid surfaces have geometric properties which permit hidden line or hidden surface elimination to be done more easily than in the general case. These properties are discussed in this paper, and an algorithm is given which exploits them.
6
Algorithm 420: hidden-line plotting program [J6]
Hugh M. Williamson · Communications of the ACM · 1972 · 47 citations · Full text
A linear time exact hidden surface algorithm
Wm. Randolph Franklin · 1980 · 44 citations